TSTP Solution File: LAT251-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT251-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 : art09.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.5s
% Output : Assurance 19.5s
% 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/LAT251-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 5 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 5)
% (binary-posweight-lex-big-order 30 #f 5 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,0,15069,4,2251)
%
%
% 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,Z)),join(meet(X,join(Z,meet(X,Y))),meet(X,join(Y,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).
% 38 [para:26.1.1,20.1.1.2] equal(join(X,zero),X).
% 40 [para:21.1.1,26.1.1] equal(meet(complement(X),X),zero).
% 41 [para:21.1.1,19.1.1] equal(meet(join(X,Y),X),X).
% 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).
% 49 [para:22.1.1,20.1.1] equal(join(meet(X,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).
% 60 [para:29.1.1,23.1.1.1] equal(meet(a,X),meet(b,meet(a,X))).
% 64 [para:19.1.1,23.1.1.1] equal(meet(X,Y),meet(X,meet(join(X,Z),Y))).
% 70 [hyper:27,40,demod:47,cut:16] equal(complement(complement(X)),X).
% 71 [para:40.1.1,23.1.1.1,demod:54] equal(zero,meet(complement(X),meet(X,Y))).
% 74 [para:22.1.1,41.1.1.1] equal(meet(join(X,Y),Y),Y).
% 78 [para:25.1.1,24.1.1.1,demod:45] equal(one,join(X,join(complement(X),Y))).
% 80 [para:24.1.1,20.1.1] equal(join(X,join(Y,meet(join(X,Y),Z))),join(X,Y)).
% 90 [para:43.1.1,22.1.1] equal(X,join(meet(Y,X),X)).
% 105 [para:60.1.2,49.1.1.1] equal(join(meet(a,X),b),b).
% 126 [para:21.1.1,105.1.1.1] equal(join(meet(X,a),b),b).
% 130 [para:26.1.1,28.1.2.1.2.2,demod:38] equal(meet(X,join(complement(X),Y)),join(meet(X,Y),meet(X,join(complement(X),meet(X,Y))))).
% 173 [para:29.1.1,71.1.2.2] equal(zero,meet(complement(b),a)).
% 175 [para:41.1.1,71.1.2.2] equal(zero,meet(complement(join(X,Y)),X)).
% 180 [para:173.1.2,21.1.1] equal(zero,meet(a,complement(b))).
% 212 [para:175.1.2,21.1.1] equal(zero,meet(X,complement(join(X,Y)))).
% 224 [para:64.1.2,21.1.1,demod:23] equal(meet(X,Y),meet(join(X,Z),meet(Y,X))).
% 513 [para:80.1.1,74.1.1.1] equal(meet(join(X,Y),join(Y,meet(join(X,Y),Z))),join(Y,meet(join(X,Y),Z))).
% 1007 [para:180.1.2,130.1.2.1,demod:51,26,38,180] equal(meet(a,join(complement(a),complement(b))),zero).
% 1010 [para:212.1.2,130.1.2.1,demod:51,26,38,212] equal(meet(X,join(complement(X),complement(join(X,Y)))),zero).
% 1029 [hyper:27,1007,demod:78,cut:16] equal(complement(a),join(complement(a),complement(b))).
% 1031 [para:1029.1.2,22.1.1] equal(complement(a),join(complement(b),complement(a))).
% 2627 [hyper:27,1010,demod:78,cut:16] equal(complement(X),join(complement(X),complement(join(X,Y)))).
% 2634 [para:2627.1.2,48.1.1.2] equal(meet(complement(join(X,Y)),complement(X)),complement(join(X,Y))).
% 2639 [para:126.1.1,2627.1.2.2.1] equal(complement(meet(X,a)),join(complement(meet(X,a)),complement(b))).
% 4177 [para:49.1.1,2634.1.1.1.1,demod:49] equal(meet(complement(X),complement(meet(X,Y))),complement(X)).
% 4178 [para:90.1.2,2634.1.1.1.1,demod:90] equal(meet(complement(X),complement(meet(Y,X))),complement(X)).
% 4260 [para:70.1.1,4177.1.1.1,demod:70] equal(meet(X,complement(meet(complement(X),Y))),X).
% 4298 [para:4260.1.1,21.1.1] equal(X,meet(complement(meet(complement(X),Y)),X)).
% 4313 [para:21.1.1,4298.1.2.1.1] equal(X,meet(complement(meet(Y,complement(X))),X)).
% 4390 [para:70.1.1,4313.1.2.1.1.2] equal(complement(X),meet(complement(meet(Y,X)),complement(X))).
% 4406 [para:4178.1.1,224.1.2.2,demod:4390] equal(complement(X),meet(join(complement(meet(Y,X)),Z),complement(X))).
% 14494 [para:4406.1.2,513.1.1.2.2,demod:4406] equal(meet(join(complement(meet(X,Y)),Z),join(Z,complement(Y))),join(Z,complement(Y))).
% 15070 [para:14494.1.2,30.1.1,demod:4390,1031,2639,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 5
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1327
% derived clauses: 983753
% kept clauses: 14905
% kept size sum: 257765
% kept mid-nuclei: 133
% kept new demods: 14394
% forw unit-subs: 804778
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 3
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 23.11
% process. runtime: 22.64
% 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/LAT251-1+eq_r.in")
%
%------------------------------------------------------------------------------