TSTP Solution File: LAT168-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT168-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 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/LAT168-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 6 1)
% (binary-posweight-lex-big-order 30 #f 6 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,1,22,0,1)
%
%
% START OF PROOF
% 15 [] equal(meet(X,join(X,Y)),X).
% 16 [] equal(join(X,meet(X,Y)),X).
% 17 [] equal(meet(X,Y),meet(Y,X)).
% 18 [] equal(join(X,Y),join(Y,X)).
% 19 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 20 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 21 [] equal(meet(join(X,Y),join(X,Z)),join(X,meet(join(X,Y),meet(join(X,Z),join(Y,meet(X,Z)))))).
% 22 [] -equal(meet(a,join(b,c)),meet(a,join(b,meet(join(a,b),join(c,meet(a,b)))))).
% 23 [para:17.1.1,15.1.1] equal(meet(join(X,Y),X),X).
% 24 [para:17.1.1,16.1.1.2] equal(join(X,meet(Y,X)),X).
% 25 [para:17.1.1,22.1.1] -equal(meet(join(b,c),a),meet(a,join(b,meet(join(a,b),join(c,meet(a,b)))))).
% 29 [para:18.1.1,15.1.1.2] equal(meet(X,join(Y,X)),X).
% 35 [para:23.1.1,16.1.1.2,demod:20] equal(join(X,join(Y,X)),join(X,Y)).
% 36 [para:18.1.1,23.1.1.1] equal(meet(join(X,Y),Y),Y).
% 40 [para:17.1.1,25.1.2.2.2.2.2] -equal(meet(join(b,c),a),meet(a,join(b,meet(join(a,b),join(c,meet(b,a)))))).
% 48 [para:15.1.1,19.1.1.1] equal(meet(X,Y),meet(X,meet(join(X,Z),Y))).
% 50 [para:19.1.1,17.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(X,Y))).
% 54 [para:19.1.1,24.1.1.2] equal(join(X,meet(Y,meet(Z,X))),X).
% 57 [para:29.1.1,19.1.1.1] equal(meet(X,Y),meet(X,meet(join(Z,X),Y))).
% 60 [para:36.1.1,19.1.1.1] equal(meet(X,Y),meet(join(Z,X),meet(X,Y))).
% 62 [para:35.1.1,29.1.1.2] equal(meet(join(X,Y),join(Y,X)),join(X,Y)).
% 72 [para:20.1.1,29.1.1.2] equal(meet(X,join(Y,join(Z,X))),X).
% 74 [para:20.1.1,36.1.1.1] equal(meet(join(X,join(Y,Z)),Z),Z).
% 81 [para:17.1.1,54.1.1.2,demod:19] equal(join(X,meet(Y,meet(X,Z))),X).
% 118 [para:16.1.1,72.1.1.2.2,demod:19] equal(meet(X,meet(Y,join(Z,X))),meet(X,Y)).
% 126 [para:24.1.1,74.1.1.1.2] equal(meet(join(X,Y),meet(Z,Y)),meet(Z,Y)).
% 169 [para:48.1.2,81.1.1.2,demod:20] equal(join(X,join(Y,meet(X,Z))),join(X,Y)).
% 174 [para:17.1.1,50.1.2.2] equal(meet(X,meet(Y,Z)),meet(Z,meet(Y,X))).
% 223 [para:35.1.1,57.1.2.2.1] equal(meet(join(X,Y),Z),meet(join(X,Y),meet(join(Y,X),Z))).
% 230 [para:35.1.1,60.1.2.1,demod:223] equal(meet(join(X,Y),Z),meet(join(Y,X),Z)).
% 555 [para:169.1.1,126.1.1.1] equal(meet(join(X,Y),meet(Z,join(Y,meet(X,U)))),meet(Z,join(Y,meet(X,U)))).
% 587 [para:62.1.1,174.1.2.2,demod:223] equal(meet(join(X,Y),Z),meet(Z,join(Y,X))).
% 613 [para:230.1.1,21.1.2.2.2,demod:555] equal(meet(join(X,Y),join(X,Z)),join(X,meet(join(Z,X),join(Y,meet(X,Z))))).
% 633 [para:230.1.1,40.1.1,demod:118,613,cut:587] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 83
% derived clauses: 6123
% kept clauses: 610
% kept size sum: 9988
% kept mid-nuclei: 0
% kept new demods: 488
% forw unit-subs: 5363
% 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.9
% process. runtime: 0.8
% 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/LAT168-1+eq_r.in")
%
%------------------------------------------------------------------------------