%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL187-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 29.5s
% Output : Assurance 29.5s
% 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/LCL187-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,11637,3,1503,14699,4,2260,17491,5,3001,17492,5,3002,17493,1,3002,17493,50,3003,17493,40,3003,17503,0,3003)
%
%
% START OF PROOF
% 17495 [] axiom(implies(or(X,X),X)).
% 17496 [] axiom(implies(X,or(Y,X))).
% 17497 [] axiom(implies(or(X,Y),or(Y,X))).
% 17498 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17499 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17500 [] equal(implies(X,Y),or(not(X),Y)).
% 17501 [] -axiom(X) | theorem(X).
% 17502 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17503 [] -theorem(implies(p,implies(not(p),q))).
% 17505 [binary:17501,17495] theorem(implies(or(X,X),X)).
% 17506 [binary:17501,17496] theorem(implies(X,or(Y,X))).
% 17507 [binary:17501,17497] theorem(implies(or(X,Y),or(Y,X))).
% 17514 [binary:17501,17498] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17519 [binary:17506,17502] theorem(or(X,Y)) | -theorem(Y).
% 17533 [binary:17502,17507] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17537 [binary:17501,17499] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17547 [para:17500.1.2,17533.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17551 [binary:17502,17514] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17557 [binary:17506,17547.2] theorem(or(or(X,Y),not(Y))).
% 17562 [binary:17519.2,17557] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17573 [binary:17502,17537] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17583 [binary:17562,17551] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17587 [binary:17533,17583] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17596 [binary:17505,17573.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17599 [binary:17507,17573.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17602 [binary:17502,17596] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17615 [binary:17587,17602] theorem(or(or(X,not(Y)),Y)).
% 17617 [binary:17533,17615] theorem(or(X,or(Y,not(X)))).
% 17657 [binary:17502,17599] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17771 [binary:17617,17657,demod:17500] theorem(or(X,implies(X,Y))).
% 17774 [para:17500.1.2,17771.1.1,slowcut:17503] 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: 919
% derived clauses: 50027
% kept clauses: 14834
% kept size sum: 222957
% kept mid-nuclei: 2777
% kept new demods: 2
% forw unit-subs: 30121
% forw double-subs: 325
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 0
% full unit cutoff: 19
% dbl unit cutoff: 0
% real runtime : 30.57
% 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/LCL187-3+eq_r.in")
%
%------------------------------------------------------------------------------