TSTP Solution File: LAT254-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT254-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 : 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 19.6s
% Output : Assurance 19.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/LAT254-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 6 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 5)
% (binary-posweight-lex-big-order 30 #f 6 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(15,40,0,30,0,1,29503,4,2255)
%
%
% START OF PROOF
% 16 [] equal(X,X).
% 17 [] equal(meet(X,X),X).
% 19 [] equal(meet(X,join(X,Y)),X).
% 20 [] equal(join(X,meet(X,Y)),X).
% 21 [] equal(meet(X,Y),meet(Y,X)).
% 22 [] equal(join(X,Y),join(Y,X)).
% 23 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 24 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 25 [] equal(join(X,complement(X)),one).
% 26 [] equal(meet(X,complement(X)),zero).
% 27 [] -equal(join(X,Y),one) | -equal(meet(X,Y),zero) | equal(complement(X),Y).
% 28 [] equal(meet(X,join(Y,meet(Z,join(X,U)))),meet(X,join(meet(X,join(Y,meet(X,Z))),meet(Z,U)))).
% 29 [] equal(meet(b,a),a).
% 30 [] -equal(join(complement(b),complement(a)),complement(a)).
% 34 [para:25.1.1,19.1.1.2] equal(meet(X,one),X).
% 38 [para:26.1.1,20.1.1.2] equal(join(X,zero),X).
% 39 [para:21.1.1,29.1.1] equal(meet(a,b),a).
% 42 [para:21.1.1,34.1.1] equal(meet(one,X),X).
% 43 [para:21.1.1,20.1.1.2] equal(join(X,meet(Y,X)),X).
% 45 [para:42.1.1,19.1.1] equal(join(one,X),one).
% 47 [para:22.1.1,25.1.1] equal(join(complement(X),X),one).
% 48 [para:22.1.1,19.1.1.2] equal(meet(X,join(Y,X)),X).
% 51 [para:22.1.1,38.1.1] equal(join(zero,X),X).
% 54 [para:51.1.1,19.1.1.2] equal(meet(zero,X),zero).
% 57 [para:54.1.1,21.1.1] equal(zero,meet(X,zero)).
% 62 [para:26.1.1,23.1.1.1,demod:54] equal(zero,meet(X,meet(complement(X),Y))).
% 69 [para:39.1.1,23.1.1.1] equal(meet(a,X),meet(a,meet(b,X))).
% 78 [para:25.1.1,24.1.1.1,demod:45] equal(one,join(X,join(complement(X),Y))).
% 87 [para:47.1.1,24.1.1.1,demod:45] equal(one,join(complement(X),join(X,Y))).
% 90 [para:43.1.1,22.1.1] equal(X,join(meet(Y,X),X)).
% 128 [para:17.1.1,28.1.2.2.2,demod:48] equal(meet(X,join(Y,Z)),meet(X,join(meet(X,join(Y,meet(X,Z))),Z))).
% 132 [para:26.1.1,28.1.2.2.1.2.2,demod:38] equal(meet(X,join(Y,meet(complement(X),join(X,Z)))),meet(X,join(meet(X,Y),meet(complement(X),Z)))).
% 144 [para:22.1.1,28.1.2.2.1.2] equal(meet(X,join(Y,meet(Z,join(X,U)))),meet(X,join(meet(X,join(meet(X,Z),Y)),meet(Z,U)))).
% 169 [para:26.1.1,69.1.2.2,demod:57] equal(meet(a,complement(b)),zero).
% 223 [para:22.1.1,78.1.2.2] equal(one,join(X,join(Y,complement(X)))).
% 228 [para:90.1.2,87.1.2.2] equal(one,join(complement(meet(X,Y)),Y)).
% 281 [para:228.1.2,22.1.1] equal(one,join(X,complement(meet(Y,X)))).
% 320 [para:281.1.2,24.1.1.1,demod:45] equal(one,join(X,join(complement(meet(Y,X)),Z))).
% 1020 [para:69.1.2,320.1.2.2.1.1] equal(one,join(meet(b,X),join(complement(meet(a,X)),Y))).
% 1315 [para:62.1.2,128.1.2.2.1.2.2,demod:132,38] equal(meet(X,join(Y,meet(complement(X),Z))),meet(X,join(Y,meet(complement(X),join(X,Z))))).
% 1549 [para:169.1.1,132.1.2.2.1,demod:62,51,1315] equal(meet(a,join(complement(b),meet(complement(a),X))),zero).
% 4773 [para:17.1.1,1549.1.1.2.2] equal(meet(a,join(complement(b),complement(a))),zero).
% 4788 [hyper:27,4773,demod:223,cut:16] equal(complement(a),join(complement(b),complement(a))).
% 29388 [para:1020.1.2,144.1.2.2.1.2,demod:19,34,24] equal(meet(b,join(complement(meet(a,X)),join(Y,meet(X,join(b,Z))))),b).
% 29504 [para:29388.1.2,30.1.1.1.1,demod:4788,29388,cut:16] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 6
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1140
% derived clauses: 898055
% kept clauses: 29197
% kept size sum: 545010
% kept mid-nuclei: 275
% kept new demods: 28196
% forw unit-subs: 757287
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 23.21
% process. runtime: 22.75
% 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/LAT254-1+eq_r.in")
%
%------------------------------------------------------------------------------