TSTP Solution File: MGT026+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT026+1 : TPTP v8.1.0. Released v2.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 : Sun Jul 17 22:09:38 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 7 unt; 0 def)
% Number of atoms : 215 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 271 ( 115 ~; 114 |; 29 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 106 ( 2 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1,hypothesis,
! [X1,X8] :
( ( environment(X1)
& X8 = critical_point(X1) )
=> ( ~ greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8))
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater(X4,X8) )
=> greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1) ).
fof(mp_non_empty_fm_and_ep,axiom,
! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& greater(cardinality_at_time(first_movers,X4),zero)
& greater(cardinality_at_time(efficient_producers,X4),zero) )
=> subpopulations(first_movers,efficient_producers,X1,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_non_empty_fm_and_ep) ).
fof(prove_l8,conjecture,
! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& greater(X4,critical_point(X1)) )
=> selection_favors(efficient_producers,first_movers,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_l8) ).
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
<=> ( greater(X5,X6)
| X5 = X6 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_or_equal) ).
fof(mp_critical_point_after_EP,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_critical_point_after_EP) ).
fof(t6,hypothesis,
! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& greater_or_equal(X4,appear(efficient_producers,X1)) )
=> greater(cardinality_at_time(efficient_producers,X4),zero) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6) ).
fof(mp_greater_transitivity,axiom,
! [X5,X6,X7] :
( ( greater(X5,X6)
& greater(X6,X7) )
=> greater(X5,X7) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_transitivity) ).
fof(mp2_favour_members,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulation(X2,X1,X4)
& subpopulation(X3,X1,X4)
& greater(cardinality_at_time(X2,X4),zero)
& cardinality_at_time(X3,X4) = zero )
=> selection_favors(X2,X3,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp2_favour_members) ).
fof(mp_subpopulations,axiom,
! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4) )
=> ( subpopulation(first_movers,X1,X4)
& subpopulation(efficient_producers,X1,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_subpopulations) ).
fof(mp1_high_growth_rates,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4)
& greater(growth_rate(X3,X4),growth_rate(X2,X4)) )
=> selection_favors(X3,X2,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp1_high_growth_rates) ).
fof(mp_first_movers_exist,axiom,
! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4) )
=> greater_or_equal(cardinality_at_time(first_movers,X4),zero) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_first_movers_exist) ).
fof(c_0_11,hypothesis,
! [X9,X10,X11] :
( ( ~ greater(growth_rate(efficient_producers,X10),growth_rate(first_movers,X10))
| ~ environment(X9)
| X10 != critical_point(X9) )
& ( ~ subpopulations(first_movers,efficient_producers,X9,X11)
| ~ greater(X11,X10)
| greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11))
| ~ environment(X9)
| X10 != critical_point(X9) ) ),
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)],[inference(fof_simplification,[status(thm)],[d1])])])])])])]) ).
fof(c_0_12,plain,
! [X5,X6] :
( ~ environment(X5)
| ~ in_environment(X5,X6)
| ~ greater(cardinality_at_time(first_movers,X6),zero)
| ~ greater(cardinality_at_time(efficient_producers,X6),zero)
| subpopulations(first_movers,efficient_producers,X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_non_empty_fm_and_ep])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& greater(X4,critical_point(X1)) )
=> selection_favors(efficient_producers,first_movers,X4) ),
inference(assume_negation,[status(cth)],[prove_l8]) ).
fof(c_0_14,plain,
! [X7,X8,X7,X8] :
( ( ~ greater_or_equal(X7,X8)
| greater(X7,X8)
| X7 = X8 )
& ( ~ greater(X7,X8)
| greater_or_equal(X7,X8) )
& ( X7 != X8
| greater_or_equal(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])])]) ).
fof(c_0_15,plain,
! [X2] :
( ~ environment(X2)
| greater_or_equal(critical_point(X2),appear(efficient_producers,X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_critical_point_after_EP])]) ).
cnf(c_0_16,hypothesis,
( greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3))
| X1 != critical_point(X2)
| ~ environment(X2)
| ~ greater(X3,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( environment(esk1_0)
& in_environment(esk1_0,esk2_0)
& greater(esk2_0,critical_point(esk1_0))
& ~ selection_favors(efficient_producers,first_movers,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_19,hypothesis,
! [X5,X6] :
( ~ environment(X5)
| ~ in_environment(X5,X6)
| ~ greater_or_equal(X6,appear(efficient_producers,X5))
| greater(cardinality_at_time(efficient_producers,X6),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6])]) ).
fof(c_0_20,plain,
! [X8,X9,X10] :
( ~ greater(X8,X9)
| ~ greater(X9,X10)
| greater(X8,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])]) ).
cnf(c_0_21,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( greater_or_equal(critical_point(X1),appear(efficient_producers,X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| X2 != critical_point(X3)
| ~ in_environment(X3,X1)
| ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(X1,X2)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulation(X6,X5,X8)
| ~ subpopulation(X7,X5,X8)
| ~ greater(cardinality_at_time(X6,X8),zero)
| cardinality_at_time(X7,X8) != zero
| selection_favors(X6,X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp2_favour_members])]) ).
fof(c_0_27,plain,
! [X5,X6] :
( ( subpopulation(first_movers,X5,X6)
| ~ environment(X5)
| ~ in_environment(X5,X6) )
& ( subpopulation(efficient_producers,X5,X6)
| ~ environment(X5)
| ~ in_environment(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_subpopulations])])]) ).
cnf(c_0_28,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater_or_equal(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( appear(efficient_producers,X1) = critical_point(X1)
| greater(critical_point(X1),appear(efficient_producers,X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_32,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| ~ greater(growth_rate(X7,X8),growth_rate(X6,X8))
| selection_favors(X7,X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp1_high_growth_rates])]) ).
cnf(c_0_33,negated_conjecture,
( greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))
| X1 != critical_point(esk1_0)
| ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| ~ greater(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
greater(esk2_0,critical_point(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_35,plain,
! [X5,X6] :
( ~ environment(X5)
| ~ in_environment(X5,X6)
| greater_or_equal(cardinality_at_time(first_movers,X6),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_first_movers_exist])]) ).
cnf(c_0_36,plain,
( selection_favors(X1,X2,X3)
| cardinality_at_time(X2,X3) != zero
| ~ greater(cardinality_at_time(X1,X3),zero)
| ~ subpopulation(X2,X4,X3)
| ~ subpopulation(X1,X4,X3)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( subpopulation(first_movers,X1,X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ in_environment(X2,X1)
| ~ greater(X1,appear(efficient_producers,X2))
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( appear(efficient_producers,X1) = critical_point(X1)
| greater(X2,appear(efficient_producers,X1))
| ~ greater(X2,critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( selection_favors(X1,X2,X3)
| ~ greater(growth_rate(X1,X3),growth_rate(X2,X3))
| ~ subpopulations(X2,X1,X4,X3)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))
| ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( greater_or_equal(cardinality_at_time(first_movers,X1),zero)
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( selection_favors(X1,first_movers,X2)
| cardinality_at_time(first_movers,X2) != zero
| ~ in_environment(X3,X2)
| ~ subpopulation(X1,X3,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( subpopulation(efficient_producers,X1,X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_46,hypothesis,
( appear(efficient_producers,X1) = critical_point(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ in_environment(X1,X2)
| ~ greater(X2,critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
| ~ environment(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
greater_or_equal(cardinality_at_time(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_25])]) ).
cnf(c_0_49,plain,
( selection_favors(efficient_producers,first_movers,X1)
| cardinality_at_time(first_movers,X1) != zero
| ~ in_environment(X2,X1)
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( appear(efficient_producers,esk1_0) = critical_point(esk1_0)
| greater(cardinality_at_time(efficient_producers,esk2_0),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_34]),c_0_24]),c_0_25])]) ).
cnf(c_0_51,negated_conjecture,
( ~ in_environment(X1,esk2_0)
| ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_52,negated_conjecture,
( cardinality_at_time(first_movers,esk2_0) = zero
| greater(cardinality_at_time(first_movers,esk2_0),zero) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( cardinality_at_time(first_movers,esk2_0) != zero
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_24]),c_0_25])]),c_0_42]) ).
cnf(c_0_54,hypothesis,
( greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ in_environment(esk1_0,X1)
| ~ greater(X1,critical_point(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_50]),c_0_25])]) ).
cnf(c_0_55,negated_conjecture,
( ~ in_environment(X1,esk2_0)
| ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
greater(cardinality_at_time(efficient_producers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_34]),c_0_24])]) ).
cnf(c_0_57,negated_conjecture,
( ~ in_environment(X1,esk2_0)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT026+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:42:34 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 11
% 0.22/1.41 # Removed by relevancy pruning/SinE : 2
% 0.22/1.41 # Initial clauses : 15
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 15
% 0.22/1.41 # Processed clauses : 57
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 4
% 0.22/1.41 # ...remaining for further processing : 53
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 10
% 0.22/1.41 # Generated clauses : 52
% 0.22/1.41 # ...of the previous two non-trivial : 49
% 0.22/1.41 # Contextual simplify-reflections : 2
% 0.22/1.41 # Paramodulations : 51
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 41
% 0.22/1.41 # Positive orientable unit clauses : 6
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 33
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 11
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 427
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 109
% 0.22/1.41 # Non-unit clause-clause subsumptions : 5
% 0.22/1.41 # Unit Clause-clause subsumption calls : 27
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 6
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 2559
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.016 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.019 s
% 0.22/1.41 # Maximum resident set size: 2788 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 59
% 0.22/1.41 # Proof object clause steps : 36
% 0.22/1.41 # Proof object formula steps : 23
% 0.22/1.41 # Proof object conjectures : 19
% 0.22/1.41 # Proof object clause conjectures : 16
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 16
% 0.22/1.41 # Proof object initial formulas used : 11
% 0.22/1.41 # Proof object generating inferences : 19
% 0.22/1.41 # Proof object simplifying inferences : 20
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 11
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 18
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 18
% 0.22/1.41 # Processed clauses : 70
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 4
% 0.22/1.41 # ...remaining for further processing : 66
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 4
% 0.22/1.41 # Backward-rewritten : 12
% 0.22/1.41 # Generated clauses : 59
% 0.22/1.41 # ...of the previous two non-trivial : 63
% 0.22/1.41 # Contextual simplify-reflections : 5
% 0.22/1.41 # Paramodulations : 57
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 48
% 0.22/1.41 # Positive orientable unit clauses : 6
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 40
% 0.22/1.41 # Current number of unprocessed clauses: 7
% 0.22/1.41 # ...number of literals in the above : 20
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 17
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 537
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 172
% 0.22/1.41 # Non-unit clause-clause subsumptions : 13
% 0.22/1.41 # Unit Clause-clause subsumption calls : 28
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 6
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 3067
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.017 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.020 s
% 0.22/1.41 # Maximum resident set size: 2788 pages
%------------------------------------------------------------------------------