TSTP Solution File: LAT011-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT011-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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/LAT011-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 3 1)
% (binary-posweight-lex-big-order 30 #f 3 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(15,40,1,30,0,1,174,50,25,189,0,25)
%
%
% START OF PROOF
% 178 [] equal(meet(X,join(X,Y)),X).
% 179 [] equal(join(X,meet(X,Y)),X).
% 180 [] equal(meet(X,Y),meet(Y,X)).
% 181 [] equal(join(X,Y),join(Y,X)).
% 182 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 185 [] equal(meet2(X,Y),meet2(Y,X)).
% 186 [] equal(meet2(X,join(X,Y)),X).
% 187 [] equal(join(X,meet2(X,Y)),X).
% 188 [] equal(meet2(meet2(X,Y),Z),meet2(X,meet2(Y,Z))).
% 189 [] -equal(meet(a,b),meet2(a,b)).
% 190 [para:180.1.1,178.1.1] equal(meet(join(X,Y),X),X).
% 192 [para:180.1.1,179.1.1.2] equal(join(X,meet(Y,X)),X).
% 194 [para:181.1.1,179.1.1] equal(join(meet(X,Y),X),X).
% 195 [para:185.1.1,189.1.2] -equal(meet(a,b),meet2(b,a)).
% 200 [para:182.1.1,179.1.1.2] equal(join(meet(X,Y),meet(X,meet(Y,Z))),meet(X,Y)).
% 204 [para:181.1.1,186.1.1.2] equal(meet2(X,join(Y,X)),X).
% 205 [para:186.1.1,185.1.1] equal(X,meet2(join(X,Y),X)).
% 206 [para:187.1.1,181.1.1] equal(X,join(meet2(X,Y),X)).
% 207 [para:185.1.1,187.1.1.2] equal(join(X,meet2(Y,X)),X).
% 209 [para:181.1.1,190.1.1.1] equal(meet(join(X,Y),Y),Y).
% 211 [para:192.1.1,181.1.1] equal(X,join(meet(Y,X),X)).
% 235 [para:194.1.1,205.1.2.1] equal(meet(X,Y),meet2(X,meet(X,Y))).
% 237 [para:206.1.2,190.1.1.1] equal(meet(X,meet2(X,Y)),meet2(X,Y)).
% 253 [para:207.1.1,209.1.1.1] equal(meet(X,meet2(Y,X)),meet2(Y,X)).
% 256 [para:211.1.2,205.1.2.1] equal(meet(X,Y),meet2(Y,meet(X,Y))).
% 314 [para:237.1.1,200.1.1.2.2] equal(join(meet(X,Y),meet(X,meet2(Y,Z))),meet(X,Y)).
% 2102 [para:253.1.1,314.1.1.2] equal(join(meet(X,Y),meet2(Y,X)),meet(X,Y)).
% 2123 [para:2102.1.1,204.1.1.2,demod:256,235,188,slowcut:195] 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 kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 377
% derived clauses: 72790
% kept clauses: 2076
% kept size sum: 31480
% kept mid-nuclei: 0
% kept new demods: 1478
% forw unit-subs: 43387
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.77
% process. runtime: 0.77
% 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/LAT011-1+eq_r.in")
%
%------------------------------------------------------------------------------