TSTP Solution File: SYO607+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 16:00:38 EDT 2022
% Result : Theorem 0.17s 1.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 61 ( 6 unt; 0 def)
% Number of atoms : 326 ( 0 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 327 ( 62 ~; 234 |; 29 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 200 ( 73 sgn 31 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nc6,conjecture,
( ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ( ? [X1] :
( ( g_both(a,X1)
| ( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) ) )
& ~ g_true_only(a,X1)
& ~ ! [X2] : g_true_only(X1,X2) )
& ~ ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
& ? [X1] :
( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) )
& ~ ? [X1] :
! [X2] : g_true_only(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nc6) ).
fof(exhaustion_g,axiom,
! [X3,X4] :
( g_true_only(X3,X4)
| g_both(X3,X4)
| g_false_only(X3,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',exhaustion_g) ).
fof(false_only_g,axiom,
! [X3,X4] :
( g_false_only(X3,X4)
<=> ( g_false(X3,X4)
& ~ g_true(X3,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',false_only_g) ).
fof(true_only_g,axiom,
! [X3,X4] :
( g_true_only(X3,X4)
<=> ( g_true(X3,X4)
& ~ g_false(X3,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',true_only_g) ).
fof(c_0_4,negated_conjecture,
~ ( ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ( ? [X1] :
( ( g_both(a,X1)
| ( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) ) )
& ~ g_true_only(a,X1)
& ~ ! [X2] : g_true_only(X1,X2) )
& ~ ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
& ? [X1] :
( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) )
& ~ ? [X1] :
! [X2] : g_true_only(X1,X2) ) ),
inference(assume_negation,[status(cth)],[nc6]) ).
fof(c_0_5,negated_conjecture,
! [X3,X4,X5,X7,X8,X10,X13,X14,X17] :
( ( ~ g_false_only(a,X3)
| ~ g_false_only(X3,X4) )
& ~ g_true_only(X5,esk1_1(X5))
& ( g_false_only(a,esk3_0)
| ~ g_both(a,X7)
| g_true_only(a,X7)
| g_true_only(X7,X10)
| ~ g_both(X13,X14)
| g_false_only(X13,esk5_1(X13))
| g_true_only(esk6_0,X17) )
& ( g_false_only(esk3_0,esk4_0)
| ~ g_both(a,X7)
| g_true_only(a,X7)
| g_true_only(X7,X10)
| ~ g_both(X13,X14)
| g_false_only(X13,esk5_1(X13))
| g_true_only(esk6_0,X17) )
& ( g_false_only(a,esk3_0)
| ~ g_both(X7,X8)
| g_false_only(X7,esk2_1(X7))
| g_true_only(a,X7)
| g_true_only(X7,X10)
| ~ g_both(X13,X14)
| g_false_only(X13,esk5_1(X13))
| g_true_only(esk6_0,X17) )
& ( g_false_only(esk3_0,esk4_0)
| ~ g_both(X7,X8)
| g_false_only(X7,esk2_1(X7))
| g_true_only(a,X7)
| g_true_only(X7,X10)
| ~ g_both(X13,X14)
| g_false_only(X13,esk5_1(X13))
| g_true_only(esk6_0,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])])]) ).
fof(c_0_6,plain,
! [X5,X6] :
( g_true_only(X5,X6)
| g_both(X5,X6)
| g_false_only(X5,X6) ),
inference(variable_rename,[status(thm)],[exhaustion_g]) ).
cnf(c_0_7,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X4,X5)
| g_true_only(a,X4)
| g_false_only(a,esk3_0)
| ~ g_both(X2,X3)
| ~ g_both(a,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( g_false_only(X1,X2)
| g_both(X1,X2)
| g_true_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,esk3_0)
| g_false_only(a,X1)
| ~ g_both(X4,X5) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,X2)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X4,X5)
| g_true_only(a,X4)
| g_false_only(X4,esk2_1(X4))
| g_false_only(a,esk3_0)
| ~ g_both(X2,X3)
| ~ g_both(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ g_false_only(X1,X2)
| ~ g_false_only(a,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_true_only(esk5_1(a),X1)
| g_true_only(a,X2)
| g_true_only(esk6_0,X3)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X2) ),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X1,X4)
| g_false_only(X1,esk2_1(X1))
| g_false_only(X5,esk5_1(X5))
| g_false_only(a,esk3_0)
| g_false_only(X1,X3)
| ~ g_both(X5,X6) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,esk3_0)
| g_false_only(X4,X5)
| ~ g_false_only(X1,X6) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ g_true_only(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_true_only(esk5_1(a),X1)
| g_true_only(esk6_0,X2)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_true_only(X2,X6)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_true_only(esk6_0,X1)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X1,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,esk3_0)
| g_false_only(X4,X5) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X2,X3)
| g_true_only(X1,X4)
| g_false_only(a,esk3_0)
| g_false_only(X2,esk5_1(X2))
| g_false_only(X2,X3) ),
inference(ef,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X5,X6,X5,X6] :
( ( g_false(X5,X6)
| ~ g_false_only(X5,X6) )
& ( ~ g_true(X5,X6)
| ~ g_false_only(X5,X6) )
& ( ~ g_false(X5,X6)
| g_true(X5,X6)
| g_false_only(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[false_only_g])])])])])]) ).
fof(c_0_24,plain,
! [X5,X6,X5,X6] :
( ( g_true(X5,X6)
| ~ g_true_only(X5,X6) )
& ( ~ g_false(X5,X6)
| ~ g_true_only(X5,X6) )
& ( ~ g_true(X5,X6)
| g_false(X5,X6)
| g_true_only(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[true_only_g])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| ~ g_false_only(esk5_1(a),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X2,X3)
| g_false_only(X2,esk5_1(X2))
| g_false_only(a,esk3_0)
| g_false_only(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_28,plain,
( ~ g_false_only(X1,X2)
| ~ g_true(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( g_true(X1,X2)
| ~ g_true_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X1,X2)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_true_only(esk5_1(a),X1)
| g_true_only(a,X2)
| g_false_only(a,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X4,X5)
| g_true_only(a,X4)
| g_false_only(esk3_0,esk4_0)
| ~ g_both(X2,X3)
| ~ g_both(a,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,plain,
( ~ g_true_only(X1,X2)
| ~ g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_true_only(a,X1)
| g_false_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X4,X5)
| g_true_only(a,X4)
| g_false_only(X4,esk2_1(X4))
| g_false_only(esk3_0,esk4_0)
| ~ g_both(X2,X3)
| ~ g_both(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_37,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(X4,esk5_1(X4))
| g_false_only(esk3_0,esk4_0)
| g_false_only(a,X1)
| ~ g_both(X4,X5) ),
inference(spm,[status(thm)],[c_0_32,c_0_8]) ).
cnf(c_0_38,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,X1)
| ~ g_true_only(a,esk5_1(a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X1,X4)
| g_false_only(X1,esk2_1(X1))
| g_false_only(X5,esk5_1(X5))
| g_false_only(esk3_0,esk4_0)
| g_false_only(X1,X3)
| ~ g_both(X5,X6) ),
inference(spm,[status(thm)],[c_0_36,c_0_8]) ).
cnf(c_0_41,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,X2)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_37,c_0_8]) ).
cnf(c_0_42,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_true_only(X2,X6)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X2,esk2_1(X2))
| g_false_only(X3,X4)
| g_false_only(X2,X6) ),
inference(spm,[status(thm)],[c_0_40,c_0_8]) ).
cnf(c_0_44,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(X4,esk5_1(X4))
| g_false_only(esk3_0,esk4_0)
| g_false_only(X4,X5)
| ~ g_false_only(X1,X6) ),
inference(spm,[status(thm)],[c_0_12,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| ~ g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( g_true_only(X1,X2)
| g_false_only(a,esk3_0)
| g_false_only(X1,esk5_1(X1))
| g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_47,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(X4,esk5_1(X4))
| g_false_only(esk3_0,esk4_0)
| g_false_only(X4,X5) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_43]),c_0_44]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X1,X2)
| g_false_only(a,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(X2,X3)
| g_false_only(X2,esk5_1(X2))
| g_false_only(esk3_0,esk4_0)
| g_false_only(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
g_false_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( g_true_only(a,esk3_0)
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_42]) ).
cnf(c_0_54,negated_conjecture,
( g_true_only(X1,X2)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X1,esk5_1(X1))
| g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
~ g_false_only(esk3_0,X1),
inference(spm,[status(thm)],[c_0_12,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( g_true_only(a,esk3_0)
| ~ g_false_only(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( g_true_only(X1,X2)
| g_false_only(X1,esk5_1(X1))
| g_false_only(X1,X2) ),
inference(sr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
~ g_true_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_33,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
g_true_only(esk3_0,X1),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.00/0.09 % Command : run_ET %s %d
% 0.08/0.29 % Computer : n022.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Fri Jul 8 19:58:26 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.17/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35 # Preprocessing time : 0.014 s
% 0.17/1.35
% 0.17/1.35 # Proof found!
% 0.17/1.35 # SZS status Theorem
% 0.17/1.35 # SZS output start CNFRefutation
% See solution above
% 0.17/1.35 # Proof object total steps : 61
% 0.17/1.35 # Proof object clause steps : 52
% 0.17/1.35 # Proof object formula steps : 9
% 0.17/1.35 # Proof object conjectures : 51
% 0.17/1.35 # Proof object clause conjectures : 48
% 0.17/1.35 # Proof object formula conjectures : 3
% 0.17/1.35 # Proof object initial clauses used : 9
% 0.17/1.35 # Proof object initial formulas used : 4
% 0.17/1.35 # Proof object generating inferences : 42
% 0.17/1.35 # Proof object simplifying inferences : 9
% 0.17/1.35 # Training examples: 0 positive, 0 negative
% 0.17/1.35 # Parsed axioms : 5
% 0.17/1.35 # Removed by relevancy pruning/SinE : 0
% 0.17/1.35 # Initial clauses : 16
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 16
% 0.17/1.35 # Processed clauses : 149
% 0.17/1.35 # ...of these trivial : 0
% 0.17/1.35 # ...subsumed : 47
% 0.17/1.35 # ...remaining for further processing : 102
% 0.17/1.35 # Other redundant clauses eliminated : 0
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 62
% 0.17/1.35 # Backward-rewritten : 1
% 0.17/1.35 # Generated clauses : 860
% 0.17/1.35 # ...of the previous two non-trivial : 795
% 0.17/1.35 # Contextual simplify-reflections : 78
% 0.17/1.35 # Paramodulations : 732
% 0.17/1.35 # Factorizations : 122
% 0.17/1.35 # Equation resolutions : 0
% 0.17/1.35 # Current number of processed clauses : 33
% 0.17/1.35 # Positive orientable unit clauses : 2
% 0.17/1.35 # Positive unorientable unit clauses: 0
% 0.17/1.35 # Negative unit clauses : 3
% 0.17/1.35 # Non-unit-clauses : 28
% 0.17/1.35 # Current number of unprocessed clauses: 23
% 0.17/1.35 # ...number of literals in the above : 94
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 69
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 816
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 439
% 0.17/1.35 # Non-unit clause-clause subsumptions : 183
% 0.17/1.35 # Unit Clause-clause subsumption calls : 39
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 2
% 0.17/1.35 # BW rewrite match successes : 2
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 15165
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.076 s
% 0.17/1.35 # System time : 0.004 s
% 0.17/1.35 # Total time : 0.080 s
% 0.17/1.35 # Maximum resident set size: 3032 pages
%------------------------------------------------------------------------------