TSTP Solution File: LAT152-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT152-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 : art04.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 10.0s
% Output : Assurance 10.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/LAT152-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,1)
%
%
% START OF PROOF
% 13 [] equal(meet(X,X),X).
% 14 [] equal(join(X,X),X).
% 15 [] equal(meet(X,join(X,Y)),X).
% 16 [] equal(join(X,meet(X,Y)),X).
% 17 [] equal(meet(X,Y),meet(Y,X)).
% 18 [] equal(join(X,Y),join(Y,X)).
% 19 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 20 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 21 [] equal(meet(X,join(Y,meet(Z,join(X,U)))),meet(X,join(Y,meet(Z,join(U,meet(Z,join(X,Y))))))).
% 22 [] -equal(meet(a,join(b,meet(a,c))),meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b))))).
% 24 [para:17.1.1,16.1.1.2] equal(join(X,meet(Y,X)),X).
% 25 [para:17.1.1,22.1.1] -equal(meet(join(b,meet(a,c)),a),meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b))))).
% 31 [para:18.1.1,15.1.1.2] equal(meet(X,join(Y,X)),X).
% 39 [para:24.1.1,18.1.1] equal(X,join(meet(Y,X),X)).
% 40 [para:17.1.1,25.1.1.1.2] -equal(meet(join(b,meet(c,a)),a),meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b))))).
% 50 [para:13.1.1,19.1.1.1] equal(meet(X,Y),meet(X,meet(X,Y))).
% 51 [para:19.1.1,15.1.1] equal(meet(X,meet(Y,join(meet(X,Y),Z))),meet(X,Y)).
% 56 [para:17.1.1,19.1.1.1,demod:19] equal(meet(X,meet(Y,Z)),meet(Y,meet(X,Z))).
% 58 [para:19.1.1,24.1.1.2] equal(join(X,meet(Y,meet(Z,X))),X).
% 59 [para:16.1.1,31.1.1.2,demod:19] equal(meet(X,meet(Y,X)),meet(X,Y)).
% 60 [para:31.1.1,19.1.1] equal(meet(X,Y),meet(X,meet(Y,join(Z,meet(X,Y))))).
% 70 [para:20.1.1,18.1.1] equal(join(X,join(Y,Z)),join(Z,join(X,Y))).
% 75 [para:24.1.1,20.1.1.1] equal(join(X,Y),join(X,join(meet(Z,X),Y))).
% 84 [para:15.1.1,58.1.1.2.2,demod:20] equal(join(X,join(Y,meet(Z,X))),join(X,Y)).
% 90 [para:59.1.1,24.1.1.2] equal(join(meet(X,Y),meet(Y,X)),meet(X,Y)).
% 112 [para:21.1.2,24.1.1.2,demod:20] equal(join(X,join(meet(Y,join(Z,meet(Y,join(U,X)))),meet(U,join(X,meet(Y,join(U,Z)))))),join(X,meet(Y,join(Z,meet(Y,join(U,X)))))).
% 113 [para:24.1.1,21.1.2.2.2.2.2.2] equal(meet(X,join(meet(Y,X),meet(Z,join(X,U)))),meet(X,join(meet(Y,X),meet(Z,join(U,meet(Z,X)))))).
% 216 [para:56.1.1,39.1.2.1] equal(meet(X,Y),join(meet(X,meet(Z,Y)),meet(X,Y))).
% 305 [para:75.1.2,31.1.1.2] equal(meet(join(meet(X,Y),Z),join(Y,Z)),join(meet(X,Y),Z)).
% 324 [para:17.1.1,40.1.2.2.1] -equal(meet(join(b,meet(c,a)),a),meet(a,join(meet(join(b,meet(a,c)),a),meet(c,join(a,b))))).
% 340 [para:59.1.1,84.1.1.2.2] equal(join(meet(X,Y),join(Z,meet(Y,X))),join(meet(X,Y),Z)).
% 372 [para:90.1.1,70.1.1.2,demod:340] equal(join(X,meet(Y,Z)),join(meet(Z,Y),X)).
% 708 [para:51.1.1,39.1.2.1] equal(meet(X,join(meet(Y,X),Z)),join(meet(Y,X),meet(X,join(meet(Y,X),Z)))).
% 928 [para:60.1.2,39.1.2.1] equal(meet(X,join(Y,meet(Z,X))),join(meet(Z,X),meet(X,join(Y,meet(Z,X))))).
% 3608 [para:113.1.2,112.1.1.2.2,demod:708,928,50,14,24] equal(meet(X,join(meet(Y,X),meet(Z,X))),join(meet(Y,X),meet(Z,X))).
% 12147 [para:216.1.2,305.1.1.1,demod:216,3608,19] equal(meet(X,join(meet(Y,Z),meet(X,Z))),meet(X,Z)).
% 12385 [para:372.1.1,12147.1.1.2] equal(meet(X,join(meet(Y,X),meet(Z,Y))),meet(X,Y)).
% 13491 [para:12385.1.1,113.1.2] equal(meet(X,join(meet(join(Y,meet(Z,X)),X),meet(Z,join(X,Y)))),meet(X,join(Y,meet(Z,X)))).
% 17444 [para:17.1.1,324.1.2.2.1.1.2,demod:13491,cut:17] 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 7
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 389
% derived clauses: 191375
% kept clauses: 17421
% kept size sum: 423373
% kept mid-nuclei: 0
% kept new demods: 15335
% forw unit-subs: 159438
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 9.98
% process. runtime: 9.95
% 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/LAT152-1+eq_r.in")
%
%------------------------------------------------------------------------------