TSTP Solution File: LAT238-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT238-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 : art07.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/LAT238-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 7 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 7 5)
% (binary-posweight-lex-big-order 30 #f 7 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,1,30,0,1,41354,4,2253)
%
%
% START OF PROOF
% 16 [] equal(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(Y,meet(Z,join(Y,join(U,meet(X,Z))))))).
% 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).
% 37 [para:29.1.1,20.1.1.2] equal(join(b,a),b).
% 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).
% 40 [para:21.1.1,26.1.1] equal(meet(complement(X),X),zero).
% 42 [para:21.1.1,34.1.1] equal(meet(one,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).
% 50 [para:22.1.1,37.1.1] equal(join(a,b),b).
% 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)).
% 66 [para:23.1.1,21.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(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))).
% 98 [para:24.1.1,48.1.1.2] equal(meet(X,join(Y,join(Z,X))),X).
% 161 [para:26.1.1,69.1.2.2,demod:57] equal(meet(a,complement(b)),zero).
% 171 [para:161.1.1,28.1.2.2.2.2.2.2,demod:38] equal(meet(a,join(X,meet(complement(b),join(a,Y)))),meet(a,join(X,meet(complement(b),join(X,Y))))).
% 209 [para:22.1.1,78.1.2.2] equal(one,join(X,join(Y,complement(X)))).
% 212 [para:50.1.1,87.1.2.2] equal(one,join(complement(a),b)).
% 463 [para:24.1.1,98.1.1.2] equal(meet(X,join(Y,join(Z,join(U,X)))),X).
% 468 [para:98.1.1,66.1.1.2] equal(meet(X,Y),meet(join(Z,join(U,Y)),meet(X,Y))).
% 5622 [para:212.1.2,171.1.2.2.2.2,demod:34,26,38,40,50] equal(zero,meet(a,join(complement(a),complement(b)))).
% 5825 [para:22.1.1,5622.1.2.2] equal(zero,meet(a,join(complement(b),complement(a)))).
% 40154 [para:463.1.1,468.1.2.2,demod:463] equal(X,meet(join(Y,join(Z,join(U,join(V,join(W,X))))),X)).
% 41375 [para:27.3.1,30.1.2] -equal(join(complement(b),complement(a)),X) | -equal(meet(a,X),zero) | -equal(join(a,X),one).
% 41376 [binary:40154,41375,demod:209,5825,40154,cut:16,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 7
% seconds given: 30
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1063
% derived clauses: 860621
% kept clauses: 40679
% kept size sum: 0
% kept mid-nuclei: 278
% kept new demods: 37125
% forw unit-subs: 757040
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 11
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 23.40
% process. runtime: 22.93
% 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/LAT238-1+eq_r.in")
%
%------------------------------------------------------------------------------