%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL320-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 : 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 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/LCL320-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,0,20,0,0,11830,3,1501,14854,4,2256,17397,5,3001,17398,5,3002,17398,1,3002,17398,50,3003,17398,40,3003,17408,0,3003)
%
%
% START OF PROOF
% 17400 [] axiom(implies(or(X,X),X)).
% 17401 [] axiom(implies(X,or(Y,X))).
% 17402 [] axiom(implies(or(X,Y),or(Y,X))).
% 17403 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17404 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17405 [] equal(implies(X,Y),or(not(X),Y)).
% 17406 [] -axiom(X) | theorem(X).
% 17407 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17408 [] -theorem(or(implies(p,q),implies(not(p),q))).
% 17410 [binary:17406,17400] theorem(implies(or(X,X),X)).
% 17411 [binary:17406,17401] theorem(implies(X,or(Y,X))).
% 17412 [binary:17406,17402] theorem(implies(or(X,Y),or(Y,X))).
% 17419 [binary:17406,17403] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17424 [binary:17411,17407] theorem(or(X,Y)) | -theorem(Y).
% 17438 [binary:17407,17412] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17442 [binary:17406,17404] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17452 [para:17405.1.2,17438.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17456 [binary:17407,17419] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17462 [binary:17411,17452.2] theorem(or(or(X,Y),not(Y))).
% 17467 [binary:17424.2,17462] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17478 [binary:17407,17442] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17488 [binary:17467,17456] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17492 [binary:17438,17488] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17501 [binary:17410,17478.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17502 [binary:17411,17478.2] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 17504 [binary:17412,17478.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17507 [binary:17407,17501] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17509 [binary:17407,17502] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 17520 [binary:17492,17507] theorem(or(or(X,not(Y)),Y)).
% 17522 [binary:17438,17520] theorem(or(X,or(Y,not(X)))).
% 17562 [binary:17407,17504] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17676 [binary:17522,17562,demod:17405] theorem(or(X,implies(X,Y))).
% 17682 [binary:17438,17676] theorem(or(implies(X,Y),X)).
% 17690 [binary:17509.2,17682] theorem(or(implies(X,Y),or(Z,X))).
% 17742 [binary:17562,17690] theorem(or(implies(X,Y),or(X,Z))).
% 17769 [binary:17438,17742] theorem(or(or(X,Y),implies(X,Z))).
% 17792 [para:17405.1.2,17769.1.1.1,slowcut:17408] 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: 965
% derived clauses: 51255
% kept clauses: 15098
% kept size sum: 223095
% kept mid-nuclei: 2525
% kept new demods: 2
% forw unit-subs: 30320
% forw double-subs: 337
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 30.6
% process. runtime: 30.5
% 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/LCL320-3+eq_r.in")
%
%------------------------------------------------------------------------------