TSTP Solution File: LCL109-3 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL109-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.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 20.0s
% Output   : Assurance 20.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/LCL/LCL109-3+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 4 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 3)
% (binary-posweight-lex-big-order 30 #f 4 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(16,40,0,32,0,0,725,4,2253)
% 
% 
% START OF PROOF
% 17 [] equal(X,X).
% 18 [] equal(implies(truth,X),X).
% 20 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 22 [] equal(implies(X,X),truth).
% 24 [] equal(implies(X,truth),truth).
% 25 [] equal(implies(X,implies(Y,X)),truth).
% 28 [] equal(implies(X,implies(Y,Z)),implies(Y,implies(X,Z))).
% 31 [] equal(implies(not(X),not(Y)),implies(Y,X)).
% 32 [] -equal(implies(implies(implies(a,b),implies(b,a)),implies(b,a)),truth).
% 46 [para:31.1.1,20.1.1.1,demod:31] equal(implies(implies(X,Y),not(X)),implies(implies(Y,X),not(Y))).
% 53 [para:20.1.1,20.1.1.1,demod:18,25] equal(implies(implies(implies(X,Y),Y),X),implies(Y,X)).
% 56 [para:31.1.1,28.1.1.2] equal(implies(X,implies(Y,Z)),implies(not(Z),implies(X,not(Y)))).
% 65 [para:20.1.1,28.1.1.2] equal(implies(X,implies(implies(Y,Z),Z)),implies(implies(Z,Y),implies(X,Y))).
% 74 [para:53.1.1,28.1.1.2] equal(implies(X,implies(Y,Z)),implies(implies(implies(Z,Y),Y),implies(X,Z))).
% 110 [para:46.1.1,56.1.2.2,demod:56] equal(implies(implies(X,Y),implies(X,Z)),implies(implies(Y,X),implies(Y,Z))).
% 176 [para:65.1.1,28.1.1] equal(implies(implies(X,Y),implies(Z,Y)),implies(implies(Y,X),implies(Z,X))).
% 241 [para:110.1.1,74.1.2,demod:18,25] equal(implies(implies(X,Y),implies(Y,X)),implies(Y,X)).
% 324 [para:241.1.1,176.1.1.2] equal(implies(implies(X,implies(Y,Z)),implies(Y,Z)),implies(implies(implies(Y,Z),X),implies(implies(Z,Y),X))).
% 698 [para:110.1.1,324.1.2.2] equal(implies(implies(implies(X,Y),implies(Z,X)),implies(Z,X)),implies(implies(implies(Z,X),implies(X,Y)),implies(implies(Z,X),implies(Z,Y)))).
% 726 [para:698.1.1,32.1.1,demod:24,22,241,cut:17] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 4
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    409
%  derived clauses:   985064
%  kept clauses:      691
%  kept size sum:     14542
%  kept mid-nuclei:   0
%  kept new demods:   231
%  forw unit-subs:    166331
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     7
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  22.55
%  process. runtime:  22.53
% 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/LCL/LCL109-3+eq_r.in")
% 
%------------------------------------------------------------------------------