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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LAT031-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 : art08.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/LAT031-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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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,92,50,5,103,0,5)
% 
% 
% START OF PROOF
% 96 [] equal(meet(X,join(X,Y)),X).
% 97 [] equal(join(X,meet(X,Y)),X).
% 98 [] equal(meet(X,Y),meet(Y,X)).
% 101 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 102 [] equal(meet(X,join(Y,Z)),join(meet(X,Y),meet(X,Z))).
% 103 [] -equal(join(xx,meet(yy,zz)),meet(join(xx,yy),join(xx,zz))).
% 106 [para:98.1.1,96.1.1] equal(meet(join(X,Y),X),X).
% 108 [para:98.1.1,102.1.2.1] equal(meet(X,join(Y,Z)),join(meet(Y,X),meet(X,Z))).
% 109 [para:98.1.1,102.1.2.2] equal(meet(X,join(Y,Z)),join(meet(X,Y),meet(Z,X))).
% 122 [para:98.1.1,103.1.2] -equal(join(xx,meet(yy,zz)),meet(join(xx,zz),join(xx,yy))).
% 160 [para:97.1.1,101.1.1.1] equal(join(X,Y),join(X,join(meet(X,Z),Y))).
% 249 [para:106.1.1,109.1.2.1] equal(meet(join(X,Y),join(X,Z)),join(X,meet(Z,join(X,Y)))).
% 296 [para:108.1.2,160.1.2.2,demod:249,slowcut:122] 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 4
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    127
%  derived clauses:   7374
%  kept clauses:      261
%  kept size sum:     3519
%  kept mid-nuclei:   0
%  kept new demods:   181
%  forw unit-subs:    4561
%  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.7
%  process. runtime:  0.7
% 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/LAT031-1+eq_r.in")
% 
%------------------------------------------------------------------------------