TSTP Solution File: COM003+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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 : Fri Jul 15 01:13:29 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 13 unt; 0 def)
% Number of atoms : 185 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 221 ( 93 ~; 89 |; 28 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 107 ( 33 sgn 52 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
~ ? [X1] : algorithm_program_decides(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).
fof(p3,axiom,
( ? [X4] :
( program(X4)
& ! [X2] :
( program_halts2_halts3_outputs(X4,X2,X2,good)
& program_not_halts2_halts3_outputs(X4,X2,X2,bad) ) )
=> ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p3) ).
fof(p2,axiom,
! [X4] :
( program_program_decides(X4)
=> ! [X2,X3] :
( program_halts2_halts3_outputs(X4,X2,X3,good)
& program_not_halts2_halts3_outputs(X4,X2,X3,bad) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p2) ).
fof(program_program_decides_def,axiom,
! [X1] :
( program_program_decides(X1)
<=> ( program(X1)
& program_decides(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',program_program_decides_def) ).
fof(p1,axiom,
( ? [X1] : algorithm_program_decides(X1)
=> ? [X4] : program_program_decides(X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p1) ).
fof(program_halts2_def,axiom,
! [X1,X2] :
( program_halts2(X1,X2)
<=> ( program(X1)
& halts2(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',program_halts2_def) ).
fof(program_not_halts2_def,axiom,
! [X1,X2] :
( program_not_halts2(X1,X2)
<=> ( program(X1)
& ~ halts2(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',program_not_halts2_def) ).
fof(p4,axiom,
( ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) )
=> ? [X6] :
( program(X6)
& ! [X2] :
( ( program_halts2(X2,X2)
=> ~ halts2(X6,X2) )
& program_not_halts2_halts2_outputs(X6,X2,good) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p4) ).
fof(program_not_halts2_halts2_outputs_def,axiom,
! [X1,X2,X4] :
( program_not_halts2_halts2_outputs(X1,X2,X4)
<=> ( program_not_halts2(X2,X2)
=> halts2_outputs(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',program_not_halts2_halts2_outputs_def) ).
fof(halts2_outputs_def,axiom,
! [X1,X2,X4] :
( halts2_outputs(X1,X2,X4)
<=> ( halts2(X1,X2)
& outputs(X1,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',halts2_outputs_def) ).
fof(c_0_10,negated_conjecture,
~ ~ ? [X1] : algorithm_program_decides(X1),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_11,plain,
! [X6,X9,X9] :
( ( program(esk6_0)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk4_1(X6),esk4_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk5_1(X6),esk5_1(X6),bad) )
& ( program_halts2_halts2_outputs(esk6_0,X9,good)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk4_1(X6),esk4_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk5_1(X6),esk5_1(X6),bad) )
& ( program_not_halts2_halts2_outputs(esk6_0,X9,bad)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk4_1(X6),esk4_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk5_1(X6),esk5_1(X6),bad) ) ),
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)],[p3])])])])])])]) ).
fof(c_0_12,plain,
! [X5,X6,X7,X6,X7] :
( ( program_halts2_halts3_outputs(X5,X6,X7,good)
| ~ program_program_decides(X5) )
& ( program_not_halts2_halts3_outputs(X5,X6,X7,bad)
| ~ program_program_decides(X5) ) ),
inference(distribute,[status(thm)],[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)],[p2])])])])])]) ).
fof(c_0_13,plain,
! [X2,X2] :
( ( program(X2)
| ~ program_program_decides(X2) )
& ( program_decides(X2)
| ~ program_program_decides(X2) )
& ( ~ program(X2)
| ~ program_decides(X2)
| program_program_decides(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[program_program_decides_def])])])])]) ).
fof(c_0_14,plain,
! [X5] :
( ~ algorithm_program_decides(X5)
| program_program_decides(esk3_0) ),
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)],[p1])])])])])]) ).
fof(c_0_15,negated_conjecture,
algorithm_program_decides(esk10_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_16,plain,
( program_halts2_halts2_outputs(esk6_0,X2,good)
| ~ program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( program(X1)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( program_program_decides(esk3_0)
| ~ algorithm_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
algorithm_program_decides(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( program(esk6_0)
| ~ program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X3,X4,X3,X4] :
( ( program(X3)
| ~ program_halts2(X3,X4) )
& ( halts2(X3,X4)
| ~ program_halts2(X3,X4) )
& ( ~ program(X3)
| ~ halts2(X3,X4)
| program_halts2(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[program_halts2_def])])])])]) ).
fof(c_0_24,plain,
! [X3,X4,X3,X4] :
( ( program(X3)
| ~ program_not_halts2(X3,X4) )
& ( ~ halts2(X3,X4)
| ~ program_not_halts2(X3,X4) )
& ( ~ program(X3)
| halts2(X3,X4)
| program_not_halts2(X3,X4) ) ),
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)],[program_not_halts2_def])])])])])]) ).
fof(c_0_25,plain,
! [X7,X10,X10] :
( ( program(esk9_0)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk7_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk8_1(X7),bad) )
& ( ~ program_halts2(X10,X10)
| ~ halts2(esk9_0,X10)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk7_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk8_1(X7),bad) )
& ( program_not_halts2_halts2_outputs(esk9_0,X10,good)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk7_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk8_1(X7),bad) ) ),
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)],[p4])])])])])])])]) ).
cnf(c_0_26,plain,
( program_halts2_halts2_outputs(esk6_0,X1,good)
| ~ program_program_decides(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_27,negated_conjecture,
program_program_decides(esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( program(esk6_0)
| ~ program_program_decides(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_29,plain,
( program_not_halts2_halts2_outputs(esk6_0,X2,bad)
| ~ program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_30,plain,
! [X5,X6,X7,X5,X6,X7] :
( ( ~ program_not_halts2_halts2_outputs(X5,X6,X7)
| ~ program_not_halts2(X6,X6)
| halts2_outputs(X5,X6,X7) )
& ( program_not_halts2(X6,X6)
| program_not_halts2_halts2_outputs(X5,X6,X7) )
& ( ~ halts2_outputs(X5,X6,X7)
| program_not_halts2_halts2_outputs(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[program_not_halts2_halts2_outputs_def])])])])]) ).
cnf(c_0_31,plain,
( program_halts2(X1,X2)
| ~ halts2(X1,X2)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( program_not_halts2(X1,X2)
| halts2(X1,X2)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( program_not_halts2_halts2_outputs(esk9_0,X2,good)
| ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
program_halts2_halts2_outputs(esk6_0,X1,good),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
program(esk6_0),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_36,plain,
( program_not_halts2_halts2_outputs(esk6_0,X1,bad)
| ~ program_program_decides(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_37,plain,
( halts2_outputs(X1,X2,X3)
| ~ program_not_halts2(X2,X2)
| ~ program_not_halts2_halts2_outputs(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( program_not_halts2(X1,X2)
| program_halts2(X1,X2)
| ~ program(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( program_not_halts2_halts2_outputs(esk9_0,X1,good)
| ~ program_not_halts2_halts2_outputs(esk6_0,esk8_1(esk6_0),bad) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
program_not_halts2_halts2_outputs(esk6_0,X1,bad),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_41,plain,
( program(esk9_0)
| ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_42,plain,
( halts2_outputs(X1,X2,X3)
| program_halts2(X2,X2)
| ~ program_not_halts2_halts2_outputs(X1,X2,X3)
| ~ program(X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
program_not_halts2_halts2_outputs(esk9_0,X1,good),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
( program(esk9_0)
| ~ program_not_halts2_halts2_outputs(esk6_0,esk8_1(esk6_0),bad) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_35])]) ).
cnf(c_0_45,plain,
( ~ program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk7_1(X1),good)
| ~ program(X1)
| ~ halts2(esk9_0,X2)
| ~ program_halts2(X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_46,plain,
! [X5,X6,X7,X5,X6,X7] :
( ( halts2(X5,X6)
| ~ halts2_outputs(X5,X6,X7) )
& ( outputs(X5,X7)
| ~ halts2_outputs(X5,X6,X7) )
& ( ~ halts2(X5,X6)
| ~ outputs(X5,X7)
| halts2_outputs(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[halts2_outputs_def])])])])]) ).
cnf(c_0_47,negated_conjecture,
( halts2_outputs(esk9_0,X1,good)
| program_halts2(X1,X1)
| ~ program(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
program(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_40])]) ).
cnf(c_0_49,negated_conjecture,
( ~ program_not_halts2_halts2_outputs(esk6_0,esk8_1(esk6_0),bad)
| ~ halts2(esk9_0,X1)
| ~ program_halts2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_34]),c_0_35])]) ).
cnf(c_0_50,plain,
( halts2(X1,X2)
| ~ halts2_outputs(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( halts2_outputs(esk9_0,esk9_0,good)
| program_halts2(esk9_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_53,negated_conjecture,
( ~ halts2(esk9_0,X1)
| ~ program_halts2(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_40])]) ).
cnf(c_0_54,negated_conjecture,
halts2(esk9_0,esk9_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
~ program_halts2(esk9_0,esk9_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_54]),c_0_48])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 20:10:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 16
% 0.22/1.40 # Removed by relevancy pruning/SinE : 4
% 0.22/1.40 # Initial clauses : 31
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 31
% 0.22/1.40 # Processed clauses : 54
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 1
% 0.22/1.40 # ...remaining for further processing : 53
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 3
% 0.22/1.40 # Backward-rewritten : 6
% 0.22/1.40 # Generated clauses : 43
% 0.22/1.40 # ...of the previous two non-trivial : 29
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 43
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 44
% 0.22/1.40 # Positive orientable unit clauses : 10
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 34
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 9
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 321
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 242
% 0.22/1.40 # Non-unit clause-clause subsumptions : 4
% 0.22/1.40 # Unit Clause-clause subsumption calls : 15
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 6
% 0.22/1.40 # BW rewrite match successes : 6
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2570
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.013 s
% 0.22/1.40 # System time : 0.005 s
% 0.22/1.40 # Total time : 0.018 s
% 0.22/1.40 # Maximum resident set size: 3004 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 57
% 0.22/1.40 # Proof object clause steps : 36
% 0.22/1.40 # Proof object formula steps : 21
% 0.22/1.40 # Proof object conjectures : 19
% 0.22/1.40 # Proof object clause conjectures : 16
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 16
% 0.22/1.40 # Proof object initial formulas used : 10
% 0.22/1.40 # Proof object generating inferences : 17
% 0.22/1.40 # Proof object simplifying inferences : 22
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 16
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 43
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 43
% 0.22/1.40 # Processed clauses : 130
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 9
% 0.22/1.40 # ...remaining for further processing : 120
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 5
% 0.22/1.40 # Backward-rewritten : 15
% 0.22/1.40 # Generated clauses : 192
% 0.22/1.40 # ...of the previous two non-trivial : 171
% 0.22/1.40 # Contextual simplify-reflections : 15
% 0.22/1.40 # Paramodulations : 191
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 99
% 0.22/1.40 # Positive orientable unit clauses : 11
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 86
% 0.22/1.40 # Current number of unprocessed clauses: 66
% 0.22/1.40 # ...number of literals in the above : 213
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 21
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2823
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1960
% 0.22/1.40 # Non-unit clause-clause subsumptions : 28
% 0.22/1.40 # Unit Clause-clause subsumption calls : 152
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 7
% 0.22/1.40 # BW rewrite match successes : 7
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 5040
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.021 s
% 0.22/1.40 # System time : 0.004 s
% 0.22/1.40 # Total time : 0.025 s
% 0.22/1.40 # Maximum resident set size: 3200 pages
%------------------------------------------------------------------------------