TSTP Solution File: LAT148-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT148-1 : TPTP v3.4.2. Released v3.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 69.6s
% Output : Assurance 69.6s
% 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/LAT148-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 7 1)
% (binary-posweight-lex-big-order 30 #f 7 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(11,40,0,22,0,0,40185,3,3014,52671,4,4507,62136,5,6001,62137,1,6001,62137,50,6005,62137,40,6005,62148,0,6005)
%
%
% START OF PROOF
% 62141 [] equal(meet(X,join(X,Y)),X).
% 62142 [] equal(join(X,meet(X,Y)),X).
% 62143 [] equal(meet(X,Y),meet(Y,X)).
% 62144 [] equal(join(X,Y),join(Y,X)).
% 62145 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 62146 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 62147 [] equal(meet(X,join(Y,meet(Z,U))),meet(X,join(Y,meet(Z,join(Y,meet(U,join(Y,Z))))))).
% 62148 [] -equal(meet(a,join(b,meet(a,c))),meet(a,join(b,meet(a,join(meet(a,b),meet(c,join(a,b))))))).
% 62149 [para:62143.1.1,62141.1.1] equal(meet(join(X,Y),X),X).
% 62150 [para:62143.1.1,62142.1.1.2] equal(join(X,meet(Y,X)),X).
% 62154 [para:62143.1.1,62148.1.2.2.2] -equal(meet(a,join(b,meet(a,c))),meet(a,join(b,meet(join(meet(a,b),meet(c,join(a,b))),a)))).
% 62157 [para:62144.1.1,62141.1.1.2] equal(meet(X,join(Y,X)),X).
% 62163 [para:62149.1.1,62142.1.1.2,demod:62146] equal(join(X,join(Y,X)),join(X,Y)).
% 62164 [para:62144.1.1,62149.1.1.1] equal(meet(join(X,Y),Y),Y).
% 62178 [para:62141.1.1,62145.1.1.1] equal(meet(X,Y),meet(X,meet(join(X,Z),Y))).
% 62180 [para:62145.1.1,62143.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(X,Y))).
% 62192 [para:62163.1.1,62157.1.1.2] equal(meet(join(X,Y),join(Y,X)),join(X,Y)).
% 62201 [para:62150.1.1,62146.1.1.1] equal(join(X,Y),join(X,join(meet(Z,X),Y))).
% 62202 [para:62146.1.1,62157.1.1.2] equal(meet(X,join(Y,join(Z,X))),X).
% 62204 [para:62146.1.1,62164.1.1.1] equal(meet(join(X,join(Y,Z)),Z),Z).
% 62230 [para:62147.1.2,62143.1.1] equal(meet(X,join(Y,meet(Z,U))),meet(join(Y,meet(Z,join(Y,meet(U,join(Y,Z))))),X)).
% 62256 [para:62142.1.1,62202.1.1.2.2,demod:62145] equal(meet(X,meet(Y,join(Z,X))),meet(X,Y)).
% 62258 [para:62202.1.1,62145.1.1] equal(meet(X,Y),meet(X,meet(Y,join(Z,join(U,meet(X,Y)))))).
% 62265 [para:62150.1.1,62204.1.1.1.2] equal(meet(join(X,Y),meet(Z,Y)),meet(Z,Y)).
% 62296 [para:62143.1.1,62154.1.2.2.2.1.2] -equal(meet(a,join(b,meet(a,c))),meet(a,join(b,meet(join(meet(a,b),meet(join(a,b),c)),a)))).
% 62389 [para:62192.1.1,62180.1.1.2] equal(meet(X,join(Y,Z)),meet(join(Z,Y),meet(X,join(Y,Z)))).
% 62576 [para:62163.1.1,62256.1.1.2.2,demod:62389] equal(meet(X,join(Y,Z)),meet(join(Z,Y),X)).
% 62622 [para:62178.1.2,62265.1.1.2,demod:62178] equal(meet(join(X,meet(join(Y,Z),U)),meet(Y,U)),meet(Y,U)).
% 62987 [para:62576.1.1,62147.1.2.2.2.2.2] equal(meet(X,join(Y,meet(Z,U))),meet(X,join(Y,meet(Z,join(Y,meet(join(Z,Y),U)))))).
% 65256 [para:62258.1.2,62178.1.2.2,demod:62178] equal(meet(X,meet(Y,join(Z,join(U,meet(join(X,V),Y))))),meet(X,Y)).
% 67648 [para:62230.1.1,62296.1.2,demod:62987,62201] -equal(meet(a,join(b,meet(a,c))),meet(join(b,meet(join(meet(a,b),meet(join(a,b),c)),join(b,meet(a,c)))),a)).
% 83448 [para:62622.1.1,62230.1.1.2.2,demod:65256,62145,slowcut:67648] 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 1
% clause depth limited to 7
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1051
% derived clauses: 963569
% kept clauses: 82192
% kept size sum: 510942
% kept mid-nuclei: 0
% kept new demods: 59797
% forw unit-subs: 827510
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 14
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 70.88
% process. runtime: 70.44
% 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/LAT148-1+eq_r.in")
%
%------------------------------------------------------------------------------