TSTP Solution File: LCL456+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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 : Sun Jul 17 10:11:19 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of formulae : 83 ( 42 unt; 0 def)
% Number of atoms : 157 ( 25 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 125 ( 51 ~; 50 |; 11 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 109 ( 6 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_equiv) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',substitution_of_equivalents) ).
fof(and_2,axiom,
( and_2
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(hilbert_and_2,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',principia_op_implies_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(hilbert_and_1,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(principia_r3,conjecture,
r3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',principia_r3) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(c_0_22,plain,
! [X3,X4] :
( ( ~ modus_ponens
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
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)],[modus_ponens])])])])])])]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ( ~ and_3
| is_a_theorem(implies(X3,implies(X4,and(X3,X4)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
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)],[and_3])])])])])]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_28,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ op_equiv
| equiv(X3,X4) = and(implies(X3,X4),implies(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X3,X4))
| X3 = X4 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
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)],[substitution_of_equivalents])])])])])])]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_37,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_38,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ( ~ and_2
| is_a_theorem(implies(and(X3,X4),X4)) )
& ( ~ is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0))
| and_2 ) ),
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)],[and_2])])])])])]) ).
fof(c_0_40,plain,
! [X3,X4] :
( ~ op_implies_or
| implies(X3,X4) = or(not(X3),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])])]) ).
fof(c_0_41,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(X3,not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])])]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_43,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(and(X1,X2),X2))
| ~ and_2 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
and_2,
inference(split_conjunct,[status(thm)],[hilbert_and_2]) ).
fof(c_0_46,plain,
! [X3,X4] :
( ( ~ and_1
| is_a_theorem(implies(and(X3,X4),X3)) )
& ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ) ),
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)],[and_1])])])])])]) ).
cnf(c_0_47,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_49,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_53,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
and_1,
inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).
cnf(c_0_55,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_56,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_57,plain,
( and(X1,X2) = X2
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_32]),c_0_52])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_59,plain,
implies(and(X1,not(X2)),X3) = or(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_60,plain,
! [X3,X4] :
( ~ op_or
| or(X3,X4) = not(and(not(X3),not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])])]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_57]) ).
cnf(c_0_62,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_64,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
fof(c_0_65,plain,
! [X3,X4] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ) ),
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)],[modus_tollens])])])])])]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_56]),c_0_64])]) ).
fof(c_0_68,negated_conjecture,
~ r3,
inference(assume_negation,[status(cth)],[principia_r3]) ).
cnf(c_0_69,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_70,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_71,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
fof(c_0_72,plain,
! [X6,X7] :
( ( ~ r3
| is_a_theorem(implies(or(X6,X7),or(X7,X6))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
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)],[r3])])])])])]) ).
fof(c_0_73,negated_conjecture,
~ r3,
inference(fof_simplification,[status(thm)],[c_0_68]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_67]),c_0_70])]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_71,c_0_55]) ).
cnf(c_0_76,plain,
( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,negated_conjecture,
~ r3,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_74,c_0_67]) ).
cnf(c_0_79,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_75]),c_0_67]),c_0_55]),c_0_66])]) ).
cnf(c_0_80,plain,
~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))),
inference(sr,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 19:26:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.015 s
% 0.26/1.43
% 0.26/1.43 # Failure: Out of unprocessed clauses!
% 0.26/1.43 # OLD status GaveUp
% 0.26/1.43 # Parsed axioms : 53
% 0.26/1.43 # Removed by relevancy pruning/SinE : 51
% 0.26/1.43 # Initial clauses : 3
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 3
% 0.26/1.43 # Processed clauses : 3
% 0.26/1.43 # ...of these trivial : 0
% 0.26/1.43 # ...subsumed : 1
% 0.26/1.43 # ...remaining for further processing : 2
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 0
% 0.26/1.43 # Generated clauses : 0
% 0.26/1.43 # ...of the previous two non-trivial : 0
% 0.26/1.43 # Contextual simplify-reflections : 0
% 0.26/1.43 # Paramodulations : 0
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 2
% 0.26/1.43 # Positive orientable unit clauses : 0
% 0.26/1.43 # Positive unorientable unit clauses: 0
% 0.26/1.43 # Negative unit clauses : 2
% 0.26/1.43 # Non-unit-clauses : 0
% 0.26/1.43 # Current number of unprocessed clauses: 0
% 0.26/1.43 # ...number of literals in the above : 0
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 0
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.43 # Non-unit clause-clause subsumptions : 0
% 0.26/1.43 # Unit Clause-clause subsumption calls : 0
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 0
% 0.26/1.43 # BW rewrite match successes : 0
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 512
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.012 s
% 0.26/1.43 # System time : 0.003 s
% 0.26/1.43 # Total time : 0.015 s
% 0.26/1.43 # Maximum resident set size: 2736 pages
% 0.26/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.26/1.43 # Preprocessing time : 0.020 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 83
% 0.26/1.43 # Proof object clause steps : 48
% 0.26/1.43 # Proof object formula steps : 35
% 0.26/1.43 # Proof object conjectures : 4
% 0.26/1.43 # Proof object clause conjectures : 1
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 22
% 0.26/1.43 # Proof object initial formulas used : 22
% 0.26/1.43 # Proof object generating inferences : 13
% 0.26/1.43 # Proof object simplifying inferences : 32
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 53
% 0.26/1.43 # Removed by relevancy pruning/SinE : 0
% 0.26/1.43 # Initial clauses : 82
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 82
% 0.26/1.43 # Processed clauses : 2610
% 0.26/1.43 # ...of these trivial : 84
% 0.26/1.43 # ...subsumed : 1880
% 0.26/1.43 # ...remaining for further processing : 646
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 69
% 0.26/1.43 # Backward-rewritten : 223
% 0.26/1.43 # Generated clauses : 27786
% 0.26/1.43 # ...of the previous two non-trivial : 26159
% 0.26/1.43 # Contextual simplify-reflections : 946
% 0.26/1.43 # Paramodulations : 27786
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 354
% 0.26/1.43 # Positive orientable unit clauses : 117
% 0.26/1.43 # Positive unorientable unit clauses: 2
% 0.26/1.43 # Negative unit clauses : 4
% 0.26/1.43 # Non-unit-clauses : 231
% 0.26/1.43 # Current number of unprocessed clauses: 12560
% 0.26/1.43 # ...number of literals in the above : 21572
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 292
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 42178
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 41345
% 0.26/1.43 # Non-unit clause-clause subsumptions : 2872
% 0.26/1.43 # Unit Clause-clause subsumption calls : 969
% 0.26/1.43 # Rewrite failures with RHS unbound : 24
% 0.26/1.43 # BW rewrite match attempts : 1034
% 0.26/1.43 # BW rewrite match successes : 102
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 354193
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.335 s
% 0.26/1.43 # System time : 0.011 s
% 0.26/1.43 # Total time : 0.346 s
% 0.26/1.43 # Maximum resident set size: 19964 pages
%------------------------------------------------------------------------------