TSTP Solution File: LAT037-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT037-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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 0.0s
% Output : Assurance 0.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/LAT037-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 3 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 3)
% (binary-posweight-lex-big-order 30 #f 3 3)
% (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(21,40,1,42,0,1)
%
%
% START OF PROOF
% 23 [] equal(meet(X,X),X).
% 24 [] equal(join(X,X),X).
% 25 [] equal(meet(X,join(X,Y)),X).
% 27 [] equal(meet(X,Y),meet(Y,X)).
% 28 [] equal(join(X,Y),join(Y,X)).
% 29 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 30 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 31 [] equal(meet(X,n0),n0).
% 32 [] equal(join(X,n0),X).
% 33 [] equal(meet(X,n1),X).
% 35 [] equal(meet(X,join(Y,Z)),join(Y,meet(Z,X))) | -equal(meet(Y,X),Y).
% 36 [] equal(join(xx,yy),n1).
% 37 [] equal(join(xx,zz),n1).
% 38 [] equal(meet(xx,yy),n0).
% 39 [] equal(meet(xx,zz),n0).
% 40 [] equal(join(X,meet(Y,Z)),meet(join(X,Y),join(X,Z))).
% 41 [] equal(meet(X,join(Y,Z)),join(meet(X,Y),meet(X,Z))).
% 42 [] -equal(yy,zz).
% 43 [hyper:35,23,demod:25] equal(X,join(X,meet(Y,X))).
% 44 [para:24.1.1,40.1.2.2,demod:43] equal(X,meet(join(X,Y),X)).
% 46 [hyper:35,33,demod:33] equal(meet(n1,join(X,Y)),join(X,Y)).
% 48 [para:36.1.1,40.1.2.1,demod:46] equal(join(xx,meet(yy,X)),join(xx,X)).
% 50 [para:44.1.2,33.1.1] equal(n1,join(n1,X)).
% 52 [para:23.1.1,41.1.2.2] equal(meet(X,join(Y,X)),join(meet(X,Y),X)).
% 54 [para:31.1.1,41.1.2.1] equal(meet(X,join(n0,Y)),join(n0,meet(X,Y))).
% 66 [para:27.1.1,38.1.1] equal(meet(yy,xx),n0).
% 67 [para:27.1.1,39.1.1] equal(meet(zz,xx),n0).
% 72 [para:66.1.1,41.1.2.2,demod:32] equal(meet(yy,join(X,xx)),meet(yy,X)).
% 73 [para:28.1.1,32.1.1] equal(join(n0,X),X).
% 78 [para:28.1.1,37.1.1] equal(join(zz,xx),n1).
% 79 [para:67.1.1,41.1.2.1,demod:73,54] equal(meet(zz,join(xx,X)),meet(zz,X)).
% 102 [para:37.1.1,30.1.1.1,demod:50] equal(n1,join(xx,join(zz,X))).
% 113 [para:28.1.1,102.1.2.2] equal(n1,join(xx,join(X,zz))).
% 130 [para:78.1.1,72.1.1.2,demod:33] equal(yy,meet(yy,zz)).
% 134 [para:130.1.2,27.1.1] equal(yy,meet(zz,yy)).
% 135 [para:130.1.2,43.1.2.2] equal(zz,join(zz,yy)).
% 140 [para:134.1.2,29.1.1.1] equal(meet(yy,X),meet(zz,meet(yy,X))).
% 141 [para:135.1.2,40.1.2.1,demod:25] equal(join(zz,meet(yy,X)),zz).
% 154 [para:141.1.1,28.1.1] equal(zz,join(meet(yy,X),zz)).
% 171 [para:48.1.1,79.1.1.2,demod:140,79] equal(meet(zz,X),meet(yy,X)).
% 172 [para:79.1.1,52.1.2.1,demod:154,33,171,113,30,cut:42] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 3
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 82
% derived clauses: 2301
% kept clauses: 128
% kept size sum: 1130
% kept mid-nuclei: 0
% kept new demods: 132
% forw unit-subs: 1962
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.3
% 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/LAT037-1+eq_r.in")
%
%------------------------------------------------------------------------------