TSTP Solution File: LAT089-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT089-1 : TPTP v3.4.2. Released v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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/LAT089-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(7,40,0,14,0,1,88,50,7,95,0,7)
%
%
% START OF PROOF
% 90 [] equal(join(meet(X,Y),meet(X,join(X,Y))),X).
% 91 [] equal(join(meet(X,X),meet(Y,join(X,X))),X).
% 92 [] equal(join(meet(X,Y),meet(Y,join(X,Y))),Y).
% 93 [] equal(meet(meet(join(X,Y),join(Z,X)),X),X).
% 94 [] equal(join(join(meet(X,Y),meet(Z,X)),X),X).
% 95 [] -equal(meet(b,a),meet(a,b)).
% 96 [para:90.1.1,90.1.1.2.2] equal(join(meet(meet(X,Y),meet(X,join(X,Y))),meet(meet(X,Y),X)),meet(X,Y)).
% 98 [para:92.1.1,90.1.1.2.2] equal(join(meet(meet(X,Y),meet(Y,join(X,Y))),meet(meet(X,Y),Y)),meet(X,Y)).
% 104 [para:92.1.1,93.1.1.1.1] equal(meet(meet(X,join(Y,meet(Z,X))),meet(Z,X)),meet(Z,X)).
% 110 [para:94.1.1,93.1.1.1.2] equal(meet(meet(join(X,Y),X),X),X).
% 111 [para:93.1.1,94.1.1.1.2] equal(join(join(meet(X,Y),X),X),X).
% 112 [para:90.1.1,110.1.1.1.1] equal(meet(meet(X,meet(X,Y)),meet(X,Y)),meet(X,Y)).
% 113 [para:92.1.1,110.1.1.1.1] equal(meet(meet(X,meet(Y,X)),meet(Y,X)),meet(Y,X)).
% 115 [para:111.1.1,90.1.1.2.2] equal(join(meet(join(meet(X,Y),X),X),meet(join(meet(X,Y),X),X)),join(meet(X,Y),X)).
% 116 [para:111.1.1,92.1.1.2.2] equal(join(meet(join(meet(X,Y),X),X),meet(X,X)),X).
% 120 [para:93.1.1,112.1.1.1.2,demod:93] equal(meet(X,X),X).
% 125 [para:120.1.1,91.1.1.2,demod:120] equal(join(X,join(X,X)),X).
% 126 [para:120.1.1,93.1.1.1] equal(meet(join(X,X),X),X).
% 130 [para:125.1.1,90.1.1.2.2,demod:120] equal(join(meet(X,join(X,X)),X),X).
% 131 [para:125.1.1,92.1.1.2.2,demod:130,126] equal(X,join(X,X)).
% 132 [para:125.1.1,93.1.1.1.1] equal(meet(meet(X,join(Y,X)),X),X).
% 133 [para:131.1.2,91.1.1.2.2,demod:120] equal(join(X,meet(Y,X)),X).
% 140 [para:111.1.1,98.1.1.1.2.2,demod:131,120] equal(meet(meet(join(meet(X,Y),X),X),X),meet(join(meet(X,Y),X),X)).
% 147 [para:113.1.1,111.1.1.1.1,demod:133] equal(meet(X,Y),meet(Y,meet(X,Y))).
% 152 [para:147.1.2,96.1.1.1.1,demod:131,147,120,133] equal(meet(meet(X,Y),Y),meet(X,Y)).
% 154 [para:152.1.1,110.1.1] equal(meet(join(X,Y),X),X).
% 162 [para:111.1.1,154.1.1.1] equal(meet(X,join(meet(X,Y),X)),join(meet(X,Y),X)).
% 187 [para:116.1.1,90.1.1.2.2,demod:115,140,120] equal(join(meet(X,Y),X),meet(join(meet(X,Y),X),X)).
% 197 [para:162.1.1,132.1.1.1,demod:187] equal(join(meet(X,Y),X),X).
% 199 [para:197.1.1,90.1.1.2.2,demod:131] equal(meet(meet(X,Y),X),meet(X,Y)).
% 204 [para:199.1.1,91.1.1.2,demod:131,120] equal(join(X,meet(X,Y)),X).
% 208 [para:154.1.1,199.1.1.1,demod:154] equal(meet(X,join(X,Y)),X).
% 216 [para:204.1.1,104.1.1.1.2] equal(meet(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 245 [para:216.1.1,90.1.1.1,demod:208] equal(join(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 248 [para:216.1.1,96.1.1.1.1,demod:120,216,245,slowcut:95] 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 5
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 145
% derived clauses: 7598
% kept clauses: 225
% kept size sum: 3053
% kept mid-nuclei: 0
% kept new demods: 235
% forw unit-subs: 6392
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.11
% process. runtime: 0.10
% 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/LAT089-1+eq_r.in")
%
%------------------------------------------------------------------------------