TSTP Solution File: LAT036-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT036-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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 99.5s
% Output : Assurance 99.5s
% 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/LAT036-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 6 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 3)
% (binary-posweight-lex-big-order 30 #f 6 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(25,40,0,50,0,0,26731,4,2266,26731,50,2327,26731,40,2327,26756,0,2327,38627,3,2928,40560,4,3231,41261,5,3529,41262,1,3529,41262,50,3531,41262,40,3531,41287,0,3531,54412,3,4132,61121,4,4439,65981,5,4732,65981,1,4732,65981,50,4734,65981,40,4734,66006,0,4734,111233,3,7743,118531,4,9238,121393,5,10741,121393,5,10742,121393,1,10742,121393,50,10746,121393,40,10746,121418,0,10746)
%
%
% START OF PROOF
% 121395 [] equal(meet(X,X),X).
% 121396 [] equal(join(X,X),X).
% 121397 [] equal(meet(X,join(X,Y)),X).
% 121398 [] equal(join(X,meet(X,Y)),X).
% 121399 [] equal(meet(X,Y),meet(Y,X)).
% 121400 [] equal(join(X,Y),join(Y,X)).
% 121401 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 121402 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 121403 [] equal(meet(X,n0),n0).
% 121404 [] equal(join(X,n0),X).
% 121405 [] equal(meet(X,n1),X).
% 121406 [] equal(join(X,n1),n1).
% 121412 [] equal(join(X,meet(Y,Z)),meet(join(X,Y),join(X,Z))).
% 121413 [] equal(meet(X,join(Y,Z)),meet(join(meet(X,Y),X),join(meet(X,Y),Z))).
% 121414 [] equal(join(k(k(aa)),join(aa,k(aa))),join(aa,k(aa))).
% 121415 [] equal(join(k(k(k(bb))),join(aa,k(aa))),join(aa,k(aa))).
% 121416 [] equal(join(k(k(aa)),join(k(aa),join(k(bb),k(cc)))),join(k(aa),join(k(bb),k(cc)))).
% 121417 [] equal(join(k(k(k(bb))),join(k(aa),join(k(bb),k(cc)))),join(k(aa),join(k(bb),k(cc)))).
% 121418 [] -equal(join(k(k(aa)),join(k(k(k(bb))),join(meet(aa,join(k(bb),k(cc))),k(aa)))),join(meet(aa,join(k(bb),k(cc))),k(aa))).
% 121419 [para:121403.1.1,121412.1.1.2,demod:121404] equal(X,meet(join(X,Y),X)).
% 121423 [para:121413.1.2,121395.1.1] equal(meet(X,join(Y,X)),join(meet(X,Y),X)).
% 121429 [para:121406.1.1,121413.1.2.2,demod:121401,121423,121405,121406] equal(X,meet(X,join(Y,X))).
% 121434 [para:121419.1.2,121398.1.1.2,demod:121402] equal(join(X,join(Y,X)),join(X,Y)).
% 121442 [para:121400.1.1,121412.1.1] equal(join(meet(X,Y),Z),meet(join(Z,X),join(Z,Y))).
% 121452 [para:121429.1.2,121413.1.2.1.1,demod:121397,121429,121396,121402] equal(meet(X,join(Y,join(X,Z))),X).
% 121460 [para:121400.1.1,121415.1.1.2] equal(join(k(k(k(bb))),join(k(aa),aa)),join(aa,k(aa))).
% 121463 [para:121434.1.1,121429.1.2.2] equal(join(X,Y),meet(join(X,Y),join(Y,X))).
% 121466 [para:121452.1.1,121399.1.1] equal(X,meet(join(Y,join(X,Z)),X)).
% 121481 [para:121400.1.1,121466.1.2.1.2] equal(X,meet(join(Y,join(Z,X)),X)).
% 121492 [para:121398.1.1,121481.1.2.1.2] equal(meet(X,Y),meet(join(Z,X),meet(X,Y))).
% 121547 [para:121400.1.1,121418.1.1.2.2,demod:121416,121414,121417,121460,121412] -equal(meet(join(aa,k(aa)),join(k(aa),join(k(bb),k(cc)))),join(meet(aa,join(k(bb),k(cc))),k(aa))).
% 121582 [para:121463.1.2,121401.1.1.1] equal(meet(join(X,Y),Z),meet(join(X,Y),meet(join(Y,X),Z))).
% 121624 [para:121434.1.1,121492.1.2.1,demod:121582] equal(meet(join(X,Y),Z),meet(join(Y,X),Z)).
% 122370 [para:121442.1.2,121624.1.2,slowcut:121547] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 3
% clause depth limited to 6
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2950
% derived clauses: 2082951
% kept clauses: 117850
% kept size sum: 17597
% kept mid-nuclei: 3563
% kept new demods: 46615
% forw unit-subs: 1635921
% forw double-subs: 61231
% forw overdouble-subs: 0
% backward subs: 42
% fast unit cutoff: 77
% full unit cutoff: 1
% dbl unit cutoff: 1
% real runtime : 108.25
% process. runtime: 107.63
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/LAT036-1+eq_r.in")
%
%------------------------------------------------------------------------------