TSTP Solution File: LAT005-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT005-5 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LAT/LAT005-5+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(32,40,0,64,0,0)
%
%
% START OF PROOF
% 36 [] join(n0,X,X).
% 37 [] meet(n0,X,n0).
% 40 [] -meet(X,Y,Z) | meet(Y,X,Z).
% 41 [] -join(X,Y,Z) | join(Y,X,Z).
% 43 [] -join(X,Y,Z) | meet(X,Z,X).
% 44 [] -meet(U,Z,V) | -meet(U,X,W) | -meet(X,Y,Z) | meet(W,Y,V).
% 45 [] -meet(U,Y,V) | -meet(W,X,U) | -meet(X,Y,Z) | meet(W,Z,V).
% 49 [] -meet(X,Y,Z) | -meet(U,Y,U) | -join(U,Z,W) | -join(U,X,V) | meet(Y,V,W).
% 50 [] meet(X,Y,meet_of(X,Y)).
% 51 [] -meet(X,Y,U) | -meet(X,Y,Z) | equal(Z,U).
% 52 [] join(X,Y,join_of(X,Y)).
% 53 [] -join(X,Y,U) | -join(X,Y,Z) | equal(Z,U).
% 54 [] meet(a,b,c).
% 56 [] meet(c,r2,n0).
% 57 [] meet(r2,b,e).
% 58 [] join(a,b,c2).
% 60 [] meet(c2,r1,n0).
% 61 [] meet(r2,a,d).
% 62 [] join(r1,e,a2).
% 63 [] join(r1,d,b2).
% 64 [] -meet(a2,b2,r1).
% 101 [hyper:41,36] join(X,n0,X).
% 536 [hyper:40,56] meet(r2,c,n0).
% 798 [hyper:40,57] meet(b,r2,e).
% 887 [hyper:41,58] join(b,a,c2).
% 888 [hyper:43,58] meet(a,c2,a).
% 1031 [hyper:40,60] meet(r1,c2,n0).
% 1106 [hyper:40,61] meet(a,r2,d).
% 1198 [hyper:41,62] join(e,r1,a2).
% 1199 [hyper:43,62] meet(r1,a2,r1).
% 1815 [hyper:44,536,61,54] meet(d,b,n0).
% 2070 [hyper:43,887] meet(b,c2,b).
% 2578 [hyper:40,888] meet(c2,a,a).
% 8628 [hyper:45,1815,37,798] meet(d,e,n0).
% 11050 [hyper:40,50] meet(X,Y,meet_of(Y,X)).
% 13447 [hyper:51,50,57] equal(e,meet_of(r2,b)).
% 13460 [hyper:51,50,1106] equal(d,meet_of(a,r2)).
% 15568 [hyper:44,2070,50,57,demod:13447] meet(e,c2,e).
% 18310 [hyper:53,52,101] equal(X,join_of(X,n0)).
% 18327 [hyper:53,52,1198] equal(a2,join_of(e,r1)).
% 19787 [hyper:45,2578,50,1106,demod:13460] meet(c2,d,d).
% 32244 [hyper:49,15568,52,52,1031,demod:18310,18327] meet(c2,a2,e).
% 33150 [hyper:51,19787,50] equal(meet_of(c2,d),d).
% 46339 [hyper:44,32244,11050,8628,demod:33150] meet(d,a2,n0).
% 56305 [hyper:49,46339,1199,52,63,demod:18310,cut:64] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 169
% derived clauses: 131908
% kept clauses: 5035
% kept size sum: 31494
% kept mid-nuclei: 51113
% kept new demods: 149
% forw unit-subs: 68214
% forw double-subs: 1555
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1808
% full unit cutoff: 80
% dbl unit cutoff: 0
% real runtime : 2.5
% process. runtime: 2.1
% specific non-discr-tree subsumption statistics:
% tried: 6169
% length fails: 0
% strength fails: 4777
% predlist fails: 1350
% aux str. fails: 34
% by-lit fails: 0
% full subs tried: 8
% full subs fail: 8
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LAT/LAT005-5+eq_r.in")
%
%------------------------------------------------------------------------------