%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL207-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 : 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 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/LCL207-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,2,20,0,2,11897,3,1532,15350,4,2292,18015,5,3003,18015,5,3003,18015,1,3003,18015,50,3004,18015,40,3004,18025,0,3004)
%
%
% START OF PROOF
% 18017 [] axiom(implies(or(X,X),X)).
% 18018 [] axiom(implies(X,or(Y,X))).
% 18019 [] axiom(implies(or(X,Y),or(Y,X))).
% 18020 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18021 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18022 [] equal(implies(X,Y),or(not(X),Y)).
% 18023 [] -axiom(X) | theorem(X).
% 18024 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 18025 [] -theorem(implies(not(implies(p,q)),implies(q,p))).
% 18027 [binary:18023,18017] theorem(implies(or(X,X),X)).
% 18028 [binary:18023,18018] theorem(implies(X,or(Y,X))).
% 18029 [binary:18023,18019] theorem(implies(or(X,Y),or(Y,X))).
% 18033 [para:18022.1.2,18028.1.1.2] theorem(implies(X,implies(Y,X))).
% 18036 [binary:18023,18020] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18040 [binary:18027,18024] -theorem(or(X,X)) | theorem(X).
% 18041 [binary:18028,18024] theorem(or(X,Y)) | -theorem(Y).
% 18054 [para:18022.1.2,18029.1.1.2] theorem(implies(or(X,not(Y)),implies(Y,X))).
% 18055 [binary:18024,18029] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 18059 [binary:18023,18021] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18069 [para:18022.1.2,18055.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 18071 [para:18022.1.2,18036.1.1.1,demod:18022] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 18073 [binary:18024,18036] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 18076 [binary:18024,18054] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 18079 [binary:18028,18069.2] theorem(or(or(X,Y),not(Y))).
% 18084 [binary:18041.2,18079] theorem(or(X,or(or(Y,Z),not(Z)))).
% 18091 [para:18022.1.2,18076.1.1] -theorem(implies(X,not(Y))) | theorem(implies(Y,not(X))).
% 18094 [para:18022.1.2,18059.1.1.2.1,demod:18022] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 18095 [binary:18024,18059] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 18100 [para:18022.1.2,18071.1.1.1.2,demod:18022] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 18101 [binary:18024,18071] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 18105 [binary:18084,18073] theorem(or(or(X,Y),or(Z,not(Y)))).
% 18109 [binary:18055,18105] theorem(or(or(X,not(Y)),or(Z,Y))).
% 18114 [binary:18024,18094] theorem(implies(implies(X,Y),implies(X,Z))) | -theorem(implies(Y,Z)).
% 18118 [binary:18027,18095.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 18120 [binary:18033,18095.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 18121 [binary:18029,18095.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 18124 [binary:18024,18118] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 18128 [para:18022.1.2,18120.1.1.1,demod:18022] theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 18131 [binary:18024,18100] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 18137 [binary:18109,18124] theorem(or(or(X,not(Y)),Y)).
% 18139 [binary:18055,18137] theorem(or(X,or(Y,not(X)))).
% 18142 [binary:18028,18101] theorem(or(X,implies(Y,Y))).
% 18148 [binary:18040,18142] theorem(implies(X,X)).
% 18155 [binary:18091,18148] theorem(implies(X,not(not(X)))).
% 18175 [binary:18029,18114.2] theorem(implies(implies(X,or(Y,Z)),implies(X,or(Z,Y)))).
% 18179 [binary:18024,18121] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 18212 [binary:18024,18128] theorem(implies(X,implies(Y,Z))) | -theorem(implies(X,Z)).
% 18250 [binary:18059,18131] theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))).
% 18282 [binary:18024,18175] -theorem(implies(X,or(Y,Z))) | theorem(implies(X,or(Z,Y))).
% 18293 [binary:18139,18179,demod:18022] theorem(or(X,implies(X,Y))).
% 18561 [binary:18024,18250] theorem(implies(implies(X,Y),or(Z,Y))) | -theorem(or(Z,X)).
% 19207 [binary:18293,18561.2] theorem(implies(implies(implies(X,Y),Z),or(X,Z))).
% 19284 [binary:18282,19207] theorem(implies(implies(implies(X,Y),Z),or(Z,X))).
% 19325 [binary:18024,19284] -theorem(implies(implies(X,Y),Z)) | theorem(or(Z,X)).
% 19439 [binary:18155,19325,demod:18022] theorem(implies(not(implies(X,Y)),X)).
% 19443 [binary:18212.2,19439,slowcut:18025] 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: 1531
% derived clauses: 77983
% kept clauses: 16489
% kept size sum: 243192
% kept mid-nuclei: 2656
% kept new demods: 2
% forw unit-subs: 38220
% forw double-subs: 522
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 12
% dbl unit cutoff: 0
% real runtime : 30.28
% process. runtime: 30.28
% 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/LCL207-3+eq_r.in")
%
%------------------------------------------------------------------------------