TSTP Solution File: LAT026-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT026-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 : art02.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 128.6s
% Output : Assurance 128.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/LAT026-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(9,40,1,18,0,1,3862,3,3003,5166,4,4508,5558,5,6002,5558,1,6002,5558,50,6002,5558,40,6002,5567,0,6002,8179,3,7507,9004,4,8256,9570,5,9003,9570,1,9003,9570,50,9003,9570,40,9003,9579,0,9003,29344,3,10513,37058,4,11259,40186,5,12004,40186,1,12004,40186,50,12006,40186,40,12006,40195,0,12006)
%
%
% START OF PROOF
% 40189 [] equal(join(X,X),X).
% 40190 [] equal(meet(X,Y),meet(Y,X)).
% 40191 [] equal(join(X,Y),join(Y,X)).
% 40192 [] equal(meet(meet(join(X,Y),join(Z,Y)),Y),Y).
% 40193 [] equal(join(join(meet(X,Y),meet(Z,Y)),Y),Y).
% 40194 [] equal(meet(X,join(Y,join(X,Z))),X).
% 40195 [] -equal(meet(meet(a,b),c),meet(a,meet(b,c))).
% 40199 [para:40191.1.1,40194.1.1.2] equal(meet(X,join(join(X,Y),Z)),X).
% 40208 [para:40190.1.1,40195.1.2.2] -equal(meet(meet(a,b),c),meet(a,meet(c,b))).
% 40211 [para:40192.1.1,40190.1.1] equal(X,meet(X,meet(join(Y,X),join(Z,X)))).
% 40212 [para:40191.1.1,40192.1.1.1.1] equal(meet(meet(join(X,Y),join(Z,X)),X),X).
% 40216 [para:40189.1.1,40193.1.1.1] equal(join(meet(X,Y),Y),Y).
% 40217 [para:40190.1.1,40193.1.1.1.1] equal(join(join(meet(X,Y),meet(Z,X)),X),X).
% 40218 [para:40190.1.1,40193.1.1.1.2] equal(join(join(meet(X,Y),meet(Y,Z)),Y),Y).
% 40230 [para:40193.1.1,40199.1.1.2] equal(meet(meet(X,Y),Y),meet(X,Y)).
% 40240 [para:40190.1.1,40216.1.1.1] equal(join(meet(X,Y),X),X).
% 40241 [para:40216.1.1,40191.1.1] equal(X,join(X,meet(Y,X))).
% 40242 [para:40216.1.1,40194.1.1.2.2] equal(meet(meet(X,Y),join(Z,Y)),meet(X,Y)).
% 40252 [para:40190.1.1,40230.1.1.1] equal(meet(meet(X,Y),X),meet(Y,X)).
% 40253 [para:40240.1.1,40191.1.1] equal(X,join(X,meet(X,Y))).
% 40254 [para:40240.1.1,40194.1.1.2.2] equal(meet(meet(X,Y),join(Z,X)),meet(X,Y)).
% 40257 [para:40240.1.1,40199.1.1.2.1] equal(meet(meet(X,Y),join(X,Z)),meet(X,Y)).
% 40271 [para:40253.1.2,40192.1.1.1.1] equal(meet(meet(X,join(Y,meet(X,Z))),meet(X,Z)),meet(X,Z)).
% 40284 [para:40241.1.2,40211.1.2.2.2] equal(meet(X,Y),meet(meet(X,Y),meet(join(Z,meet(X,Y)),Y))).
% 40290 [para:40241.1.2,40212.1.1.1.2] equal(meet(meet(join(meet(X,Y),Z),Y),meet(X,Y)),meet(X,Y)).
% 40299 [para:40217.1.1,40191.1.1] equal(X,join(X,join(meet(X,Y),meet(Z,X)))).
% 40314 [para:40217.1.1,40212.1.1.1.1] equal(meet(meet(X,join(Y,join(meet(X,Z),meet(U,X)))),join(meet(X,Z),meet(U,X))),join(meet(X,Z),meet(U,X))).
% 40318 [para:40218.1.1,40191.1.1] equal(X,join(X,join(meet(Y,X),meet(X,Z)))).
% 40333 [para:40218.1.1,40212.1.1.1.1] equal(meet(meet(X,join(Y,join(meet(Z,X),meet(X,U)))),join(meet(Z,X),meet(X,U))),join(meet(Z,X),meet(X,U))).
% 40343 [para:40242.1.1,40216.1.1.1] equal(join(meet(X,Y),join(Z,Y)),join(Z,Y)).
% 40344 [para:40242.1.1,40241.1.2.2] equal(join(X,Y),join(join(X,Y),meet(Z,Y))).
% 40345 [para:40241.1.2,40242.1.1.2] equal(meet(meet(X,meet(Y,Z)),Z),meet(X,meet(Y,Z))).
% 40346 [para:40253.1.2,40242.1.1.2] equal(meet(meet(X,meet(Y,Z)),Y),meet(X,meet(Y,Z))).
% 40452 [para:40252.1.1,40254.1.1.1,demod:40252] equal(meet(meet(X,Y),join(Z,meet(Y,X))),meet(X,Y)).
% 40476 [para:40252.1.1,40257.1.1.1,demod:40252] equal(meet(meet(X,Y),join(meet(Y,X),Z)),meet(X,Y)).
% 40791 [para:40253.1.2,40343.1.1.2,demod:40253] equal(join(meet(X,meet(Y,Z)),Y),Y).
% 40854 [para:40190.1.1,40791.1.1.1] equal(join(meet(meet(X,Y),Z),X),X).
% 40969 [para:40854.1.1,40191.1.1] equal(X,join(X,meet(meet(X,Y),Z))).
% 43306 [para:40345.1.1,40318.1.2.2.1] equal(X,join(X,join(meet(Y,meet(Z,X)),meet(X,U)))).
% 43660 [para:40344.1.2,40271.1.1.1.2] equal(meet(meet(X,join(Y,Z)),meet(X,Z)),meet(X,Z)).
% 43729 [para:40346.1.1,40299.1.2.2.2] equal(X,join(X,join(meet(X,Y),meet(Z,meet(X,U))))).
% 45463 [para:40969.1.2,40284.1.2.2.1] equal(meet(meet(X,Y),Z),meet(meet(meet(X,Y),Z),meet(X,Z))).
% 69297 [para:43306.1.2,40314.1.1.1.2,demod:40452] equal(meet(X,Y),join(meet(X,meet(Z,Y)),meet(Y,X))).
% 72612 [para:43729.1.2,40333.1.1.1.2,demod:40476] equal(meet(X,Y),join(meet(Y,X),meet(X,meet(Y,Z)))).
% 81748 [para:69297.1.2,40290.1.1.1.1,demod:45463] equal(meet(meet(X,Y),meet(Z,Y)),meet(X,meet(Z,Y))).
% 81822 [para:43660.1.1,69297.1.2.1,demod:72612] equal(meet(meet(X,join(Y,Z)),Z),meet(Z,X)).
% 81854 [para:81822.1.1,40190.1.1] equal(meet(X,Y),meet(X,meet(Y,join(Z,X)))).
% 82204 [para:40241.1.2,81854.1.2.2.2,demod:81748,slowcut:40208] 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
% seconds given: 180
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3014
% derived clauses: 6372010
% kept clauses: 77916
% kept size sum: 0
% kept mid-nuclei: 0
% kept new demods: 69009
% forw unit-subs: 2821903
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 42
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 132.98
% process. runtime: 131.42
% 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/LAT026-1+eq_r.in")
%
%------------------------------------------------------------------------------