TSTP Solution File: SEU053+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Tue Jul 19 09:16:36 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 20 unt; 0 def)
% Number of atoms : 173 ( 64 equ)
% Maximal formula atoms : 23 ( 2 avg)
% Number of connectives : 189 ( 80 ~; 80 |; 16 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 5 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t122_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ! [X2,X3] : relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3))
=> one_to_one(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t122_funct_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_r1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d7_xboole_0) ).
fof(t117_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,relation_dom(X2))
=> relation_image(X2,singleton(X1)) = singleton(apply(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t117_funct_1) ).
fof(d8_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
& in(X3,relation_dom(X1))
& apply(X1,X2) = apply(X1,X3) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_funct_1) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotence_k3_xboole_0) ).
fof(fc2_subset_1,axiom,
! [X1] : ~ empty(singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc2_subset_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc12_relat_1) ).
fof(t17_zfmisc_1,axiom,
! [X1,X2] :
( X1 != X2
=> disjoint(singleton(X1),singleton(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t17_zfmisc_1) ).
fof(t149_relat_1,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,empty_set) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t149_relat_1) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_boole) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ! [X2,X3] : relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3))
=> one_to_one(X1) ) ),
inference(assume_negation,[status(cth)],[t122_funct_1]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_14,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])])]) ).
fof(c_0_15,negated_conjecture,
! [X5,X6] :
( relation(esk15_0)
& function(esk15_0)
& relation_image(esk15_0,set_intersection2(X5,X6)) = set_intersection2(relation_image(esk15_0,X5),relation_image(esk15_0,X6))
& ~ one_to_one(esk15_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)],[c_0_12])])])])])]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ function(X4)
| ~ in(X3,relation_dom(X4))
| relation_image(X4,singleton(X3)) = singleton(apply(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t117_funct_1])]) ).
cnf(c_0_17,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
relation_image(esk15_0,set_intersection2(X1,X2)) = set_intersection2(relation_image(esk15_0,X1),relation_image(esk15_0,X2)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( relation_image(X1,singleton(X2)) = singleton(apply(X1,X2))
| ~ in(X2,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ( ~ one_to_one(X4)
| ~ in(X5,relation_dom(X4))
| ~ in(X6,relation_dom(X4))
| apply(X4,X5) != apply(X4,X6)
| X5 = X6
| ~ relation(X4)
| ~ function(X4) )
& ( in(esk2_1(X4),relation_dom(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( in(esk3_1(X4),relation_dom(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( apply(X4,esk2_1(X4)) = apply(X4,esk3_1(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( esk2_1(X4) != esk3_1(X4)
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) ) ),
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)],[d8_funct_1])])])])])])]) ).
cnf(c_0_24,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( disjoint(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( set_intersection2(singleton(apply(esk15_0,X1)),relation_image(esk15_0,X2)) = relation_image(esk15_0,set_intersection2(singleton(X1),X2))
| ~ in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( one_to_one(X1)
| apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ one_to_one(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,plain,
( set_intersection2(X1,X2) = empty_set
| set_intersection2(X2,X1) != empty_set ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( set_intersection2(relation_image(esk15_0,X1),singleton(apply(esk15_0,X2))) = relation_image(esk15_0,set_intersection2(X1,singleton(X2)))
| ~ in(X2,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
( set_intersection2(singleton(apply(esk15_0,esk2_1(esk15_0))),relation_image(esk15_0,X1)) = relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1))
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]),c_0_22])]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( set_intersection2(singleton(apply(esk15_0,X1)),relation_image(esk15_0,X2)) = empty_set
| relation_image(esk15_0,set_intersection2(X2,singleton(X1))) != empty_set
| ~ in(X1,relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_33,plain,
! [X3] : set_intersection2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_34,negated_conjecture,
( relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)) = empty_set
| relation_image(esk15_0,set_intersection2(X1,singleton(esk2_1(esk15_0)))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)) = relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),X1))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_36,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( relation_image(esk15_0,singleton(esk3_1(esk15_0))) = empty_set
| relation_image(esk15_0,singleton(esk2_1(esk15_0))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_36]) ).
fof(c_0_38,plain,
! [X2] : ~ empty(singleton(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc2_subset_1])]) ).
cnf(c_0_39,negated_conjecture,
( singleton(apply(esk15_0,esk3_1(esk15_0))) = empty_set
| relation_image(esk15_0,singleton(esk2_1(esk15_0))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_21]),c_0_22])]) ).
cnf(c_0_40,negated_conjecture,
( set_intersection2(relation_image(esk15_0,X1),singleton(apply(esk15_0,esk2_1(esk15_0)))) = empty_set
| relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
fof(c_0_41,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_42,plain,
~ empty(singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( singleton(apply(esk15_0,esk3_1(esk15_0))) = empty_set
| singleton(apply(esk15_0,esk2_1(esk15_0))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_44,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc12_relat_1]) ).
fof(c_0_45,plain,
! [X3,X4] :
( X3 = X4
| disjoint(singleton(X3),singleton(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_zfmisc_1])]) ).
fof(c_0_46,plain,
! [X2] :
( ~ relation(X2)
| relation_image(X2,empty_set) = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t149_relat_1])]) ).
fof(c_0_47,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
cnf(c_0_48,negated_conjecture,
( set_intersection2(singleton(apply(esk15_0,X1)),singleton(apply(esk15_0,esk2_1(esk15_0)))) = empty_set
| relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),singleton(X1))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_49,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( singleton(apply(esk15_0,esk2_1(esk15_0))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_51,plain,
( disjoint(singleton(X1),singleton(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),singleton(esk3_1(esk15_0)))) != empty_set
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_55,plain,
( set_intersection2(singleton(X1),singleton(X2)) = empty_set
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
relation_image(esk15_0,empty_set) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_52]),c_0_53]),c_0_53]),c_0_21])]) ).
cnf(c_0_57,negated_conjecture,
( esk3_1(esk15_0) = esk2_1(esk15_0)
| ~ in(esk3_1(esk15_0),relation_dom(esk15_0))
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_58,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_59,negated_conjecture,
( esk3_1(esk15_0) = esk2_1(esk15_0)
| ~ in(esk2_1(esk15_0),relation_dom(esk15_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_21]),c_0_22])]),c_0_28]) ).
cnf(c_0_60,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_61,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ relation(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_62,negated_conjecture,
esk3_1(esk15_0) = esk2_1(esk15_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_21]),c_0_22])]),c_0_28]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_21]),c_0_22])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.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 : Sun Jun 19 01:45:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 46
% 0.23/1.40 # Removed by relevancy pruning/SinE : 26
% 0.23/1.40 # Initial clauses : 33
% 0.23/1.40 # Removed in clause preprocessing : 2
% 0.23/1.40 # Initial clauses in saturation : 31
% 0.23/1.40 # Processed clauses : 57
% 0.23/1.40 # ...of these trivial : 7
% 0.23/1.40 # ...subsumed : 5
% 0.23/1.40 # ...remaining for further processing : 45
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 14
% 0.23/1.40 # Generated clauses : 45
% 0.23/1.40 # ...of the previous two non-trivial : 38
% 0.23/1.40 # Contextual simplify-reflections : 2
% 0.23/1.40 # Paramodulations : 45
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 31
% 0.23/1.40 # Positive orientable unit clauses : 19
% 0.23/1.40 # Positive unorientable unit clauses: 1
% 0.23/1.40 # Negative unit clauses : 4
% 0.23/1.40 # Non-unit-clauses : 7
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 14
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 13
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 13
% 0.23/1.40 # Non-unit clause-clause subsumptions : 7
% 0.23/1.40 # Unit Clause-clause subsumption calls : 3
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 12
% 0.23/1.40 # BW rewrite match successes : 12
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1791
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.014 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.017 s
% 0.23/1.40 # Maximum resident set size: 2992 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.017 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 64
% 0.23/1.40 # Proof object clause steps : 40
% 0.23/1.40 # Proof object formula steps : 24
% 0.23/1.40 # Proof object conjectures : 25
% 0.23/1.40 # Proof object clause conjectures : 22
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 19
% 0.23/1.40 # Proof object initial formulas used : 12
% 0.23/1.40 # Proof object generating inferences : 21
% 0.23/1.40 # Proof object simplifying inferences : 43
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 46
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 75
% 0.23/1.40 # Removed in clause preprocessing : 2
% 0.23/1.40 # Initial clauses in saturation : 73
% 0.23/1.40 # Processed clauses : 1050
% 0.23/1.40 # ...of these trivial : 9
% 0.23/1.40 # ...subsumed : 623
% 0.23/1.40 # ...remaining for further processing : 418
% 0.23/1.40 # Other redundant clauses eliminated : 1
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 140
% 0.23/1.40 # Backward-rewritten : 49
% 0.23/1.40 # Generated clauses : 9855
% 0.23/1.40 # ...of the previous two non-trivial : 3088
% 0.23/1.40 # Contextual simplify-reflections : 318
% 0.23/1.40 # Paramodulations : 9847
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 8
% 0.23/1.40 # Current number of processed clauses : 228
% 0.23/1.40 # Positive orientable unit clauses : 39
% 0.23/1.40 # Positive unorientable unit clauses: 1
% 0.23/1.40 # Negative unit clauses : 12
% 0.23/1.40 # Non-unit-clauses : 176
% 0.23/1.40 # Current number of unprocessed clauses: 366
% 0.23/1.40 # ...number of literals in the above : 1394
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 189
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 87969
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 63324
% 0.23/1.40 # Non-unit clause-clause subsumptions : 1002
% 0.23/1.40 # Unit Clause-clause subsumption calls : 245
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 18
% 0.23/1.40 # BW rewrite match successes : 13
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 654448
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.186 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.189 s
% 0.23/1.40 # Maximum resident set size: 6164 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------