TSTP Solution File: LAT143-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT143-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 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/LAT143-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
% 13 [] equal(meet(X,X),X).
% 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(join(meet(X,Y),meet(Y,Z)),join(meet(X,Y),meet(Y,join(meet(X,Y),meet(Z,join(X,Y)))))).
% 22 [] -equal(meet(a,join(meet(a,b),meet(a,c))),meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(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).
% 26 [para:17.1.1,22.1.1.2.1] -equal(meet(a,join(meet(b,a),meet(a,c))),meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b)))))).
% 32 [para:18.1.1,15.1.1.2] equal(meet(X,join(Y,X)),X).
% 33 [para:18.1.1,16.1.1] equal(join(meet(X,Y),X),X).
% 40 [para:24.1.1,18.1.1] equal(X,join(meet(Y,X),X)).
% 53 [para:19.1.1,15.1.1] equal(meet(X,meet(Y,join(meet(X,Y),Z))),meet(X,Y)).
% 56 [para:19.1.1,17.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(X,Y))).
% 61 [para:16.1.1,32.1.1.2,demod:19] equal(meet(X,meet(Y,X)),meet(X,Y)).
% 67 [para:19.1.1,40.1.2.1] equal(X,join(meet(Y,meet(Z,X)),X)).
% 78 [para:20.1.1,32.1.1.2] equal(meet(X,join(Y,join(Z,X))),X).
% 79 [para:33.1.1,20.1.1.1] equal(join(X,Y),join(meet(X,Z),join(X,Y))).
% 96 [para:17.1.1,26.1.1.2.2] -equal(meet(a,join(meet(b,a),meet(c,a))),meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b)))))).
% 106 [para:17.1.1,21.1.2.1] equal(join(meet(X,Y),meet(Y,Z)),join(meet(Y,X),meet(Y,join(meet(X,Y),meet(Z,join(X,Y)))))).
% 113 [para:23.1.1,21.1.2.2.2.2,demod:40,32,79,20] equal(join(meet(X,Y),meet(Y,join(X,join(Y,Z)))),Y).
% 125 [para:61.1.1,67.1.2.1.2] equal(meet(X,Y),join(meet(Z,meet(Y,X)),meet(X,Y))).
% 127 [para:16.1.1,78.1.1.2.2,demod:19] equal(meet(X,meet(Y,join(Z,X))),meet(X,Y)).
% 128 [para:18.1.1,78.1.1.2,demod:20] equal(meet(X,join(Y,join(X,Z))),X).
% 193 [para:56.1.1,23.1.1] equal(meet(X,meet(join(meet(Y,X),Z),Y)),meet(Y,X)).
% 462 [para:127.1.1,40.1.2.1] equal(meet(X,join(Y,Z)),join(meet(Z,X),meet(X,join(Y,Z)))).
% 930 [para:53.1.1,40.1.2.1] equal(meet(X,join(meet(Y,X),Z)),join(meet(Y,X),meet(X,join(meet(Y,X),Z)))).
% 1234 [para:113.1.1,21.1.2.2.2.2.2,demod:930,13,19,128] equal(join(meet(X,Y),meet(Y,Z)),meet(Y,join(meet(X,Y),meet(Z,Y)))).
% 1443 [para:193.1.1,125.1.2.1] equal(meet(X,join(meet(X,Y),Z)),join(meet(X,Y),meet(X,join(meet(X,Y),Z)))).
% 1702 [para:18.1.1,96.1.2.2.2.2.2,demod:462,1234] -equal(join(meet(b,a),meet(a,c)),meet(a,join(meet(a,b),meet(c,join(b,a))))).
% 2584 [para:17.1.1,106.1.2.2.2.1,demod:1443,slowcut:1702] 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: 198
% derived clauses: 36126
% kept clauses: 2560
% kept size sum: 50892
% kept mid-nuclei: 0
% kept new demods: 2017
% forw unit-subs: 31857
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.81
% process. runtime: 0.80
% 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/LAT143-1+eq_r.in")
%
%------------------------------------------------------------------------------