%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL238-3 : TPTP v3.4.2. Released v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/LCL/LCL238-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(11,40,1,22,0,1)
%
%
% START OF PROOF
% 13 [] axiom(implies(or(X,X),X)).
% 14 [] axiom(implies(X,or(Y,X))).
% 15 [] axiom(implies(or(X,Y),or(Y,X))).
% 16 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18 [] equal(implies(X,Y),or(not(X),Y)).
% 19 [] -axiom(X) | theorem(X).
% 20 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 21 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 22 [] -theorem(implies(and(p,q),and(q,p))).
% 24 [binary:19,13] theorem(implies(or(X,X),X)).
% 25 [binary:19,14] theorem(implies(X,or(Y,X))).
% 26 [binary:19,15] theorem(implies(or(X,Y),or(Y,X))).
% 30 [para:18.1.2,25.1.1.2] theorem(implies(X,implies(Y,X))).
% 33 [binary:19,16] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 39 [binary:30,20] theorem(implies(X,Y)) | -theorem(Y).
% 47 [binary:24,39.2] theorem(implies(X,implies(or(Y,Y),Y))).
% 50 [para:18.1.2,26.1.1.1] theorem(implies(implies(X,Y),or(Y,not(X)))).
% 52 [binary:20,26] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 56 [binary:19,17] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 64 [para:21.1.2,18.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 65 [para:21.1.2,21.1.2.1.2] equal(and(X,implies(Y,not(Z))),not(implies(X,and(Y,Z)))).
% 66 [para:18.1.2,47.1.1.2.1,demod:64] theorem(implies(X,or(and(Y,Y),not(Y)))).
% 71 [para:18.1.2,33.1.1.1,demod:18] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 72 [para:18.1.2,33.1.1.1.2,demod:18] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 76 [para:18.1.2,50.1.1.2,demod:64] theorem(or(and(X,Y),implies(Y,not(X)))).
% 80 [binary:20,66,slowcut:76] theorem(or(and(X,X),not(X))).
% 82 [binary:52,80,demod:18] theorem(implies(X,and(X,X))).
% 113 [para:18.1.2,56.1.1.2.1,demod:18] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 114 [binary:20,56] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 129 [para:18.1.2,71.1.1.1.2,demod:18] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 130 [binary:20,71] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 131 [binary:20,72] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 166 [binary:82,114.2] theorem(implies(or(X,Y),or(X,and(Y,Y)))).
% 176 [binary:20,166] theorem(or(X,and(Y,Y))) | -theorem(or(X,Y)).
% 248 [binary:20,129] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 251 [binary:26,130] theorem(or(X,implies(or(Y,X),Y))).
% 266 [binary:52,251] theorem(or(implies(or(X,Y),X),Y)).
% 437 [binary:266,176.2] theorem(or(implies(or(X,Y),X),and(Y,Y))).
% 585 [binary:113,248] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 586 [binary:52,437] theorem(or(and(X,X),implies(or(Y,X),Y))).
% 721 [binary:131,586] theorem(implies(or(X,Y),or(and(Y,Y),X))).
% 1069 [binary:20,721] theorem(or(and(X,X),Y)) | -theorem(or(Y,X)).
% 1293 [binary:76,1069.2,demod:18,64,65] theorem(implies(or(and(X,Y),and(X,Y)),and(Y,X))).
% 2029 [binary:20,585] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 4635 [binary:25,2029.2] theorem(implies(implies(or(X,Y),Z),implies(Y,Z))).
% 4662 [binary:20,4635] -theorem(implies(or(X,Y),Z)) | theorem(implies(Y,Z)).
% 4866 [binary:1293,4662,slowcut:22] 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 5
% clause depth limited to 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2515
% derived clauses: 163716
% kept clauses: 4205
% kept size sum: 49512
% kept mid-nuclei: 0
% kept new demods: 5
% forw unit-subs: 26467
% forw double-subs: 1064
% forw overdouble-subs: 1
% backward subs: 21
% fast unit cutoff: 0
% full unit cutoff: 7
% dbl unit cutoff: 0
% real runtime : 3.3
% process. runtime: 3.4
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% 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/LCL238-3+eq_r.in")
%
%------------------------------------------------------------------------------