TSTP Solution File: LAT257-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT257-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 20.0s
% Output : Assurance 20.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/LAT257-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,1,30,0,1,14481,4,2255)
%
%
% START OF PROOF
% 16 [] equal(X,X).
% 18 [] equal(join(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(meet(Y,join(X,Z)),meet(Z,join(X,Y)))),join(meet(X,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).
% 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).
% 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).
% 49 [para:22.1.1,20.1.1] equal(join(meet(X,Y),X),X).
% 50 [para:22.1.1,37.1.1] equal(join(a,b),b).
% 64 [para:19.1.1,23.1.1.1] equal(meet(X,Y),meet(X,meet(join(X,Z),Y))).
% 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))).
% 76 [para:18.1.1,24.1.1.1] equal(join(X,Y),join(X,join(X,Y))).
% 78 [para:25.1.1,24.1.1.1,demod:45] equal(one,join(X,join(complement(X),Y))).
% 79 [para:24.1.1,19.1.1.2] equal(meet(join(X,Y),join(X,join(Y,Z))),join(X,Y)).
% 87 [para:47.1.1,24.1.1.1,demod:45] equal(one,join(complement(X),join(X,Y))).
% 128 [para:25.1.1,28.1.1.2.1.2,demod:38,26,34] equal(meet(X,join(Y,meet(complement(X),join(X,Y)))),meet(X,Y)).
% 195 [para:50.1.1,87.1.2.2] equal(one,join(complement(a),b)).
% 201 [para:195.1.2,22.1.1] equal(one,join(b,complement(a))).
% 229 [para:48.1.1,64.1.2.2,demod:19] equal(meet(X,join(Y,join(X,Z))),X).
% 464 [para:229.1.1,66.1.1.2] equal(meet(X,Y),meet(join(Z,join(Y,U)),meet(X,Y))).
% 491 [para:49.1.1,79.1.1.2] equal(meet(join(meet(join(X,Y),Z),X),join(X,Y)),join(meet(join(X,Y),Z),X)).
% 1064 [para:201.1.2,128.1.1.2.2.2,demod:34] equal(meet(b,join(complement(a),complement(b))),meet(b,complement(a))).
% 12376 [para:1064.1.1,69.1.2.2,demod:26,69] equal(meet(a,join(complement(a),complement(b))),zero).
% 12448 [hyper:27,12376,demod:78,cut:16] equal(complement(a),join(complement(a),complement(b))).
% 12451 [para:12448.1.2,22.1.1] equal(complement(a),join(complement(b),complement(a))).
% 12453 [para:12448.1.2,48.1.1.2] equal(meet(complement(b),complement(a)),complement(b)).
% 12593 [para:12453.1.1,464.1.2.2,demod:12453] equal(complement(b),meet(join(X,join(complement(a),Y)),complement(b))).
% 13661 [para:12593.1.2,491.1.1.1.1,demod:12593] equal(meet(join(complement(b),X),join(X,join(complement(a),Y))),join(complement(b),X)).
% 14482 [para:13661.1.2,30.1.1,demod:19,76,12451,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: 1288
% derived clauses: 949237
% kept clauses: 14311
% kept size sum: 255390
% kept mid-nuclei: 139
% kept new demods: 13743
% forw unit-subs: 774440
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 22.65
% 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/LAT257-1+eq_r.in")
%
%------------------------------------------------------------------------------