%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL183-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 : art06.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 30.0s
% Output : Assurance 30.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/LCL183-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(10,40,1,20,0,1,11367,3,1509,13818,4,2253,16747,5,3002,16747,5,3002,16748,1,3002,16748,50,3004,16748,40,3004,16758,0,3004)
%
%
% START OF PROOF
% 16750 [] axiom(implies(or(X,X),X)).
% 16751 [] axiom(implies(X,or(Y,X))).
% 16752 [] axiom(implies(or(X,Y),or(Y,X))).
% 16753 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 16754 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 16755 [] equal(implies(X,Y),or(not(X),Y)).
% 16756 [] -axiom(X) | theorem(X).
% 16757 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 16758 [] -theorem(implies(implies(not(q),not(p)),implies(p,q))).
% 16760 [binary:16756,16750] theorem(implies(or(X,X),X)).
% 16761 [binary:16756,16751] theorem(implies(X,or(Y,X))).
% 16762 [binary:16756,16752] theorem(implies(or(X,Y),or(Y,X))).
% 16769 [binary:16756,16753] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 16773 [binary:16760,16757] -theorem(or(X,X)) | theorem(X).
% 16788 [binary:16757,16762] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 16792 [binary:16756,16754] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 16802 [para:16755.1.2,16788.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 16804 [para:16755.1.2,16769.1.1.1,demod:16755] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 16827 [para:16755.1.2,16792.1.1.2.1,demod:16755] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 16833 [para:16755.1.2,16804.1.1.1.2,demod:16755] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 16834 [binary:16757,16804] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 16847 [binary:16757,16827] theorem(implies(implies(X,Y),implies(X,Z))) | -theorem(implies(Y,Z)).
% 16864 [binary:16757,16833] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 16875 [binary:16761,16834] theorem(or(X,implies(Y,Y))).
% 16881 [binary:16773,16875] theorem(implies(X,X)).
% 16887 [binary:16802.2,16881] theorem(or(X,not(X))).
% 16908 [binary:16762,16847.2] theorem(implies(implies(X,or(Y,Z)),implies(X,or(Z,Y)))).
% 16983 [binary:16792,16864] theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))).
% 17015 [binary:16757,16908] -theorem(implies(X,or(Y,Z))) | theorem(implies(X,or(Z,Y))).
% 17294 [binary:16757,16983] theorem(implies(implies(X,Y),or(Z,Y))) | -theorem(or(Z,X)).
% 17939 [binary:16887,17294.2] theorem(implies(implies(not(X),Y),or(X,Y))).
% 17953 [binary:17015,17939] theorem(implies(implies(not(X),Y),or(Y,X))).
% 17961 [para:16755.1.2,17953.1.1.2,slowcut:16758] 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: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1357
% derived clauses: 68945
% kept clauses: 14780
% kept size sum: 220329
% kept mid-nuclei: 2909
% kept new demods: 2
% forw unit-subs: 33011
% forw double-subs: 542
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 23
% dbl unit cutoff: 0
% real runtime : 30.21
% process. runtime: 30.22
% 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/LCL183-3+eq_r.in")
%
%------------------------------------------------------------------------------