%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL209-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 : art01.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/LCL209-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,12011,3,1517,15220,4,2258,18668,5,3001,18669,5,3002,18669,1,3002,18669,50,3003,18669,40,3003,18679,0,3003)
%
%
% START OF PROOF
% 18671 [] axiom(implies(or(X,X),X)).
% 18672 [] axiom(implies(X,or(Y,X))).
% 18673 [] axiom(implies(or(X,Y),or(Y,X))).
% 18674 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18675 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18676 [] equal(implies(X,Y),or(not(X),Y)).
% 18677 [] -axiom(X) | theorem(X).
% 18678 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 18679 [] -theorem(implies(implies(not(p),q),or(p,q))).
% 18681 [binary:18677,18671] theorem(implies(or(X,X),X)).
% 18682 [binary:18677,18672] theorem(implies(X,or(Y,X))).
% 18683 [binary:18677,18673] theorem(implies(or(X,Y),or(Y,X))).
% 18690 [binary:18677,18674] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18694 [binary:18681,18678] -theorem(or(X,X)) | theorem(X).
% 18709 [binary:18678,18683] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 18713 [binary:18677,18675] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18723 [para:18676.1.2,18709.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 18725 [para:18676.1.2,18690.1.1.1,demod:18676] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 18754 [para:18676.1.2,18725.1.1.1.2,demod:18676] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 18755 [binary:18678,18725] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 18785 [binary:18678,18754] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 18796 [binary:18682,18755] theorem(or(X,implies(Y,Y))).
% 18802 [binary:18694,18796] theorem(implies(X,X)).
% 18808 [binary:18723.2,18802] theorem(or(X,not(X))).
% 18904 [binary:18713,18785] theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))).
% 19215 [binary:18678,18904] theorem(implies(implies(X,Y),or(Z,Y))) | -theorem(or(Z,X)).
% 19861 [binary:18808,19215.2,slowcut:18679] 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: 1422
% derived clauses: 74453
% kept clauses: 16154
% kept size sum: 241310
% kept mid-nuclei: 3430
% kept new demods: 2
% forw unit-subs: 37114
% forw double-subs: 493
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 25
% dbl unit cutoff: 0
% real runtime : 30.27
% 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/LCL209-3+eq_r.in")
%
%------------------------------------------------------------------------------