TSTP Solution File: LAT013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT013-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 : art05.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 9.6s
% Output : Assurance 9.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/LAT013-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(6,40,0,12,0,0,490,50,481,496,0,481)
%
%
% START OF PROOF
% 492 [] equal(join(X,meet(Y,meet(X,Z))),X).
% 493 [] equal(meet(X,join(Y,join(X,Z))),X).
% 494 [] equal(join(join(meet(X,Y),meet(Y,Z)),Y),Y).
% 495 [] equal(meet(meet(join(X,Y),join(Y,Z)),Y),Y).
% 496 [] -equal(meet(meet(a,b),c),meet(a,meet(b,c))).
% 497 [para:493.1.1,492.1.1.2.2] equal(join(X,meet(Y,X)),X).
% 498 [para:492.1.1,493.1.1.2.2] equal(meet(X,join(Y,X)),X).
% 499 [para:493.1.1,497.1.1.2] equal(join(join(X,join(Y,Z)),Y),join(X,join(Y,Z))).
% 500 [para:492.1.1,498.1.1.2] equal(meet(meet(X,meet(Y,Z)),Y),meet(X,meet(Y,Z))).
% 502 [para:497.1.1,498.1.1.2] equal(meet(meet(X,Y),Y),meet(X,Y)).
% 503 [para:492.1.1,494.1.1.1] equal(join(meet(X,Y),Y),Y).
% 507 [para:494.1.1,498.1.1.2] equal(meet(X,X),X).
% 509 [para:507.1.1,492.1.1.2] equal(join(X,meet(X,Y)),X).
% 511 [para:492.1.1,495.1.1.1.2,demod:502] equal(meet(join(X,Y),Y),Y).
% 512 [para:497.1.1,495.1.1.1.1] equal(meet(meet(X,join(meet(Y,X),Z)),meet(Y,X)),meet(Y,X)).
% 515 [para:498.1.1,503.1.1.1] equal(join(X,join(Y,X)),join(Y,X)).
% 516 [para:503.1.1,495.1.1.1.2] equal(meet(meet(join(X,meet(Y,Z)),Z),meet(Y,Z)),meet(Y,Z)).
% 521 [para:509.1.1,498.1.1.2] equal(meet(meet(X,Y),X),meet(X,Y)).
% 526 [para:497.1.1,511.1.1.1] equal(meet(X,meet(Y,X)),meet(Y,X)).
% 529 [para:492.1.1,515.1.1.2,demod:492] equal(join(meet(X,meet(Y,Z)),Y),Y).
% 532 [para:509.1.1,515.1.1.2,demod:509] equal(join(meet(X,Y),X),X).
% 542 [para:532.1.1,499.1.1.1.2,demod:532] equal(join(join(X,Y),meet(Y,Z)),join(X,Y)).
% 562 [para:526.1.1,500.1.1.1.2,demod:526] equal(meet(meet(X,meet(Y,Z)),Z),meet(X,meet(Y,Z))).
% 568 [para:521.1.1,529.1.1.1] equal(join(meet(meet(X,Y),Z),X),X).
% 693 [para:532.1.1,512.1.1.1.2] equal(meet(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 701 [para:568.1.1,512.1.1.1.2] equal(meet(meet(X,Y),meet(meet(Y,Z),X)),meet(meet(Y,Z),X)).
% 830 [para:542.1.1,516.1.1.1.1] equal(meet(meet(join(X,Y),Z),meet(Y,Z)),meet(Y,Z)).
% 1362 [para:693.1.1,509.1.1.2] equal(join(meet(X,Y),meet(Y,X)),meet(X,Y)).
% 1363 [para:693.1.1,532.1.1.1,demod:1362] equal(meet(X,Y),meet(Y,X)).
% 1384 [para:1363.1.1,496.1.2] -equal(meet(meet(a,b),c),meet(meet(b,c),a)).
% 1386 [para:1363.1.1,500.1.1.1.2,demod:562] equal(meet(X,meet(Y,Z)),meet(X,meet(Z,Y))).
% 1755 [para:1363.1.1,1384.1.2.1] -equal(meet(meet(a,b),c),meet(meet(c,b),a)).
% 1942 [para:1386.1.1,1363.1.1] equal(meet(X,meet(Y,Z)),meet(meet(Z,Y),X)).
% 3358 [para:830.1.1,521.1.1.1,demod:830] equal(meet(meet(X,Y),meet(join(Z,X),Y)),meet(X,Y)).
% 3397 [para:830.1.1,1942.1.2] equal(meet(meet(X,Y),meet(Y,join(Z,X))),meet(X,Y)).
% 6163 [para:497.1.1,3397.1.1.2.2] equal(meet(meet(meet(X,Y),Z),meet(Z,Y)),meet(meet(X,Y),Z)).
% 6164 [para:509.1.1,3397.1.1.2.2] equal(meet(meet(meet(X,Y),Z),meet(Z,X)),meet(meet(X,Y),Z)).
% 9409 [para:3358.1.1,701.1.1.2,demod:3358,6163] equal(meet(meet(join(X,Y),Z),Y),meet(Y,Z)).
% 9410 [para:3397.1.1,701.1.1.2,demod:3397,6164] equal(meet(meet(X,join(Y,Z)),Z),meet(Z,X)).
% 9468 [para:526.1.1,9409.1.1.1,demod:9410] equal(meet(X,Y),meet(X,meet(Y,join(Z,X)))).
% 9577 [para:497.1.1,9410.1.1.1.2] equal(meet(meet(X,Y),meet(Z,Y)),meet(meet(Z,Y),X)).
% 9694 [para:497.1.1,9468.1.2.2.2,demod:9577,slowcut:1755] 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: 987
% derived clauses: 706016
% kept clauses: 9674
% kept size sum: 197216
% kept mid-nuclei: 0
% kept new demods: 9366
% forw unit-subs: 429730
% 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 : 12.26
% process. runtime: 11.72
% 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/LAT013-1+eq_r.in")
%
%------------------------------------------------------------------------------