↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LAT009-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art10.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/LAT009-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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,0,22,0,0)
% 
% 
% START OF PROOF
% 14 [] equal(join(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(join(meet(X,Y),Z),Y),meet(Z,X)),meet(join(meet(join(X,Y),Z),Y),join(Z,X))).
% 22 [] -equal(join(a,meet(b,c)),meet(join(a,b),join(a,c))).
% 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.2] -equal(join(a,meet(c,b)),meet(join(a,b),join(a,c))).
% 27 [para:18.1.1,15.1.1.2] equal(meet(X,join(Y,X)),X).
% 28 [para:18.1.1,16.1.1] equal(join(meet(X,Y),X),X).
% 32 [para:23.1.1,16.1.1.2,demod:20] equal(join(X,join(Y,X)),join(X,Y)).
% 33 [para:18.1.1,23.1.1.1] equal(meet(join(X,Y),Y),Y).
% 34 [para:24.1.1,18.1.1] equal(X,join(meet(Y,X),X)).
% 35 [para:17.1.1,25.1.2] -equal(join(a,meet(c,b)),meet(join(a,c),join(a,b))).
% 44 [para:19.1.1,17.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(X,Y))).
% 48 [para:19.1.1,24.1.1.2] equal(join(X,meet(Y,meet(Z,X))),X).
% 51 [para:27.1.1,19.1.1.1] equal(meet(X,Y),meet(X,meet(join(Z,X),Y))).
% 52 [para:23.1.1,28.1.1.1] equal(join(X,join(X,Y)),join(X,Y)).
% 55 [para:19.1.1,34.1.2.1] equal(X,join(meet(Y,meet(Z,X)),X)).
% 59 [para:16.1.1,20.1.1.1] equal(join(X,Y),join(X,join(meet(X,Z),Y))).
% 60 [para:20.1.1,18.1.1] equal(join(X,join(Y,Z)),join(Z,join(X,Y))).
% 64 [para:20.1.1,24.1.1] equal(join(X,join(Y,meet(Z,join(X,Y)))),join(X,Y)).
% 66 [para:20.1.1,27.1.1.2] equal(meet(X,join(Y,join(Z,X))),X).
% 68 [para:20.1.1,33.1.1.1] equal(meet(join(X,join(Y,Z)),Z),Z).
% 75 [para:17.1.1,48.1.1.2,demod:19] equal(join(X,meet(Y,meet(X,Z))),X).
% 86 [para:21.1.1,15.1.1.2,demod:51,19] equal(meet(join(meet(X,Y),Z),meet(Y,join(Z,X))),meet(join(meet(X,Y),Z),Y)).
% 89 [para:17.1.1,21.1.1.1] equal(join(meet(X,join(meet(Y,X),Z)),meet(Z,Y)),meet(join(meet(join(Y,X),Z),X),join(Z,Y))).
% 100 [para:33.1.1,21.1.1.2,demod:14,20] equal(join(meet(join(meet(X,Y),join(Z,X)),Y),X),meet(join(meet(join(X,Y),join(Z,X)),Y),join(Z,X))).
% 103 [para:17.1.1,55.1.2.1,demod:19] equal(X,join(meet(Y,meet(X,Z)),X)).
% 109 [para:18.1.1,66.1.1.2,demod:20] equal(meet(X,join(Y,join(X,Z))),X).
% 111 [para:32.1.1,66.1.1.2.2] equal(meet(join(X,Y),join(Z,join(Y,X))),join(X,Y)).
% 115 [para:24.1.1,68.1.1.1.2] equal(meet(join(X,Y),meet(Z,Y)),meet(Z,Y)).
% 124 [para:75.1.1,68.1.1.1.2] equal(meet(join(X,Y),meet(Z,meet(Y,U))),meet(Z,meet(Y,U))).
% 150 [para:17.1.1,44.1.2.2] equal(meet(X,meet(Y,Z)),meet(Z,meet(Y,X))).
% 183 [para:18.1.1,35.1.2.2] -equal(join(a,meet(c,b)),meet(join(a,c),join(b,a))).
% 197 [para:51.1.2,103.1.2.1] equal(join(X,Y),join(meet(Y,Z),join(X,Y))).
% 222 [para:60.1.1,27.1.1.2] equal(meet(join(X,Y),join(Y,join(Z,X))),join(X,Y)).
% 224 [para:60.1.1,33.1.1.1] equal(meet(join(X,join(Y,Z)),join(Z,X)),join(Z,X)).
% 884 [para:21.1.1,86.1.1.1,demod:115,21,124,19,197] equal(meet(join(X,Y),meet(Z,join(meet(Y,Z),X))),meet(join(X,Y),Z)).
% 910 [para:86.1.1,150.1.1,demod:884] equal(meet(join(meet(X,Y),Z),Y),meet(join(Z,X),Y)).
% 942 [para:64.1.1,111.1.1.2,demod:910] equal(meet(join(X,Y),join(Z,X)),join(meet(Y,join(Z,X)),X)).
% 1213 [para:33.1.1,89.1.1.2,demod:100,14,20,942,197] equal(meet(join(X,Y),join(Z,X)),join(meet(join(Z,X),Y),X)).
% 1227 [para:109.1.1,89.1.1.1,demod:222,19,20,52,1213] equal(join(X,meet(join(X,Y),Z)),meet(join(X,Y),join(Z,X))).
% 1235 [para:89.1.1,59.1.2.2,demod:224,1227,19,1213,slowcut:183] 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 5
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    126
%  derived clauses:   18207
%  kept clauses:      1211
%  kept size sum:     21891
%  kept mid-nuclei:   0
%  kept new demods:   1006
%  forw unit-subs:    15283
%  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.31
%  process. runtime:  0.29
% 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/LAT009-1+eq_r.in")
% 
%------------------------------------------------------------------------------