%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL198-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 : art07.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/LCL198-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,2,11801,3,1504,14625,4,2259,17506,5,3003,17507,5,3004,17508,1,3004,17508,50,3005,17508,40,3005,17518,0,3005)
%
%
% START OF PROOF
% 17510 [] axiom(implies(or(X,X),X)).
% 17511 [] axiom(implies(X,or(Y,X))).
% 17512 [] axiom(implies(or(X,Y),or(Y,X))).
% 17513 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17514 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17515 [] equal(implies(X,Y),or(not(X),Y)).
% 17516 [] -axiom(X) | theorem(X).
% 17517 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17518 [] -theorem(implies(implies(p,implies(p,q)),implies(p,q))).
% 17520 [binary:17516,17510] theorem(implies(or(X,X),X)).
% 17521 [binary:17516,17511] theorem(implies(X,or(Y,X))).
% 17522 [binary:17516,17512] theorem(implies(or(X,Y),or(Y,X))).
% 17526 [para:17515.1.2,17521.1.1.2] theorem(implies(X,implies(Y,X))).
% 17529 [binary:17516,17513] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17533 [binary:17520,17517] -theorem(or(X,X)) | theorem(X).
% 17548 [binary:17517,17522] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17552 [binary:17516,17514] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17562 [para:17515.1.2,17548.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17564 [para:17515.1.2,17529.1.1.1,demod:17515] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17588 [binary:17517,17552] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17594 [binary:17517,17564] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 17611 [binary:17520,17588.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17612 [binary:17521,17588.2] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 17613 [binary:17526,17588.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 17614 [binary:17522,17588.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17616 [para:17515.1.2,17611.1.1.1,demod:17515] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 17619 [binary:17517,17612] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 17627 [binary:17517,17616] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 17635 [binary:17521,17594] theorem(or(X,implies(Y,Y))).
% 17641 [binary:17533,17635] theorem(implies(X,X)).
% 17651 [binary:17594,17641] theorem(or(X,implies(or(X,Y),Y))).
% 17672 [binary:17517,17614] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17674 [para:17515.1.2,17651.1.1,demod:17515] theorem(implies(X,implies(implies(X,Y),Y))).
% 17702 [binary:17562.2,17674] theorem(or(implies(implies(X,Y),Y),not(X))).
% 17739 [binary:17619.2,17702] theorem(or(implies(implies(X,Y),Y),or(Z,not(X)))).
% 17756 [binary:17613,17627] theorem(implies(or(implies(X,Y),Y),implies(X,Y))).
% 17979 [binary:17517,17756] -theorem(or(implies(X,Y),Y)) | theorem(implies(X,Y)).
% 18042 [binary:17672,17739,demod:17515] theorem(or(implies(implies(X,Y),Y),implies(X,Z))).
% 18227 [binary:17979,18042,slowcut:17518] 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: 1135
% derived clauses: 56749
% kept clauses: 15167
% kept size sum: 228595
% kept mid-nuclei: 2864
% kept new demods: 2
% forw unit-subs: 31042
% forw double-subs: 389
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 21
% dbl unit cutoff: 0
% real runtime : 30.13
% process. runtime: 30.14
% 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/LCL198-3+eq_r.in")
%
%------------------------------------------------------------------------------