TSTP Solution File: LAT240-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LAT240-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 : art03.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.7s
% Output   : Assurance 19.7s
% 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/LAT240-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,36239,4,2252)
% 
% 
% 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(Y,meet(Z,join(X,U)))),meet(X,join(Y,meet(Z,join(X,meet(Z,join(Y,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).
% 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).
% 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).
% 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).
% 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))).
% 82 [para:37.1.1,24.1.1.1] equal(join(b,X),join(b,join(a,X))).
% 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)).
% 122 [para:23.1.1,90.1.2.1] equal(X,join(meet(Y,meet(Z,X)),X)).
% 190 [para:74.1.1,71.1.2.2] equal(zero,meet(complement(join(X,Y)),Y)).
% 203 [para:22.1.1,78.1.2.2] equal(one,join(X,join(Y,complement(X)))).
% 206 [para:50.1.1,87.1.2.2] equal(one,join(complement(a),b)).
% 215 [para:206.1.2,28.1.2.2.2.2.2.2,demod:48,34] equal(meet(X,join(complement(a),meet(Y,join(X,b)))),meet(X,join(complement(a),Y))).
% 454 [para:82.1.2,190.1.2.1.1] equal(zero,meet(complement(join(b,X)),join(a,X))).
% 482 [para:122.1.2,24.1.1.1] equal(join(X,Y),join(meet(Z,meet(U,X)),join(X,Y))).
% 5943 [para:454.1.2,215.1.1.2.2,demod:18,26,38] equal(zero,meet(a,join(complement(a),complement(b)))).
% 5974 [para:22.1.1,5943.1.2.2] equal(zero,meet(a,join(complement(b),complement(a)))).
% 35006 [para:482.1.2,482.1.2.2,demod:482] equal(join(X,Y),join(meet(Z,meet(U,meet(V,meet(W,X)))),join(X,Y))).
% 36257 [para:27.3.1,30.1.2] -equal(join(complement(b),complement(a)),X) | -equal(meet(a,X),zero) | -equal(join(a,X),one).
% 36258 [binary:35006,36257,demod:203,5974,35006,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
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1102
%  derived clauses:   889426
%  kept clauses:      35542
%  kept size sum:     721195
%  kept mid-nuclei:   284
%  kept new demods:   34650
%  forw unit-subs:    808523
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  11
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  23.29
%  process. runtime:  22.86
% 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/LAT240-1+eq_r.in")
% 
%------------------------------------------------------------------------------