TSTP Solution File: SET703+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET703+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 00:53:15 EDT 2022
% Result : Theorem 0.55s 46.74s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 13 unt; 0 def)
% Number of atoms : 148 ( 39 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 142 ( 55 ~; 69 |; 11 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 98 ( 20 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI41,conjecture,
! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI41) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(unordered_pair,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[thI41]) ).
fof(c_0_8,negated_conjecture,
~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(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)],[equal_set])])])])]) ).
cnf(c_0_10,negated_conjecture,
~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[subset])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0)))
| ~ subset(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,power_set(X5))
| subset(X4,X5) )
& ( ~ subset(X4,X5)
| member(X4,power_set(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])])])]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,union(X5,X6))
| member(X4,X5)
| member(X4,X6) )
& ( ~ member(X4,X5)
| member(X4,union(X5,X6)) )
& ( ~ member(X4,X6)
| member(X4,union(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)],[union])])])])]) ).
cnf(c_0_17,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(pm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,singleton(X5))
| X4 = X5 )
& ( X4 != X5
| member(X4,singleton(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])])]) ).
cnf(c_0_20,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(pm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
| member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk5_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,unordered_pair(X5,X6))
| X4 = X5
| X4 = X6 )
& ( X4 != X5
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| member(X4,unordered_pair(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)],[unordered_pair])])])])]) ).
cnf(c_0_25,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(pm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(pm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(pm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(pm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X1
| esk1_2(unordered_pair(X1,X2),X3) = X2
| member(unordered_pair(X1,X2),power_set(X3)) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(pm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0 ),
inference(pm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
member(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_39,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_40,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_32]) ).
cnf(c_0_41,plain,
member(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_43,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(pm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_40]),c_0_41])]),c_0_32]) ).
cnf(c_0_45,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0 ),
inference(pm,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_48,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_47]),c_0_36])]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0)))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(pm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_51,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(pm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_49]),c_0_41])]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),union(singleton(esk4_0),singleton(esk5_0)))
| ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
inference(pm,[status(thm)],[c_0_50,c_0_26]) ).
cnf(c_0_54,negated_conjecture,
member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_51,c_0_52]),c_0_45])]) ).
cnf(c_0_55,negated_conjecture,
( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),singleton(esk4_0))
| ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
inference(pm,[status(thm)],[c_0_53,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52]),c_0_45])]) ).
cnf(c_0_58,negated_conjecture,
~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_54])]) ).
cnf(c_0_59,negated_conjecture,
esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_56]),c_0_36])]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET703+4 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 06:03:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.43 eprover: CPU time limit exceeded, terminating
% 0.55/46.43 eprover: CPU time limit exceeded, terminating
% 0.55/46.44 eprover: CPU time limit exceeded, terminating
% 0.55/46.45 eprover: CPU time limit exceeded, terminating
% 0.55/46.45 eprover: CPU time limit exceeded, terminating
% 0.55/46.74 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.55/46.74
% 0.55/46.74 # Failure: Resource limit exceeded (time)
% 0.55/46.74 # OLD status Res
% 0.55/46.74 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.55/46.74 # Preprocessing time : 0.015 s
% 0.55/46.74 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.55/46.74
% 0.55/46.74 # Failure: Resource limit exceeded (time)
% 0.55/46.74 # OLD status Res
% 0.55/46.74 # Preprocessing time : 0.019 s
% 0.55/46.74 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.55/46.74 # Preprocessing time : 0.014 s
% 0.55/46.74
% 0.55/46.74 # Proof found!
% 0.55/46.74 # SZS status Theorem
% 0.55/46.74 # SZS output start CNFRefutation
% See solution above
% 0.55/46.74 # Proof object total steps : 61
% 0.55/46.74 # Proof object clause steps : 46
% 0.55/46.74 # Proof object formula steps : 15
% 0.55/46.74 # Proof object conjectures : 28
% 0.55/46.74 # Proof object clause conjectures : 25
% 0.55/46.74 # Proof object formula conjectures : 3
% 0.55/46.74 # Proof object initial clauses used : 14
% 0.55/46.74 # Proof object initial formulas used : 7
% 0.55/46.74 # Proof object generating inferences : 25
% 0.55/46.74 # Proof object simplifying inferences : 32
% 0.55/46.74 # Training examples: 0 positive, 0 negative
% 0.55/46.74 # Parsed axioms : 12
% 0.55/46.74 # Removed by relevancy pruning/SinE : 0
% 0.55/46.74 # Initial clauses : 30
% 0.55/46.74 # Removed in clause preprocessing : 0
% 0.55/46.74 # Initial clauses in saturation : 30
% 0.55/46.74 # Processed clauses : 532
% 0.55/46.74 # ...of these trivial : 10
% 0.55/46.74 # ...subsumed : 128
% 0.55/46.74 # ...remaining for further processing : 394
% 0.55/46.74 # Other redundant clauses eliminated : 11
% 0.55/46.74 # Clauses deleted for lack of memory : 0
% 0.55/46.74 # Backward-subsumed : 16
% 0.55/46.74 # Backward-rewritten : 66
% 0.55/46.74 # Generated clauses : 10040
% 0.55/46.74 # ...of the previous two non-trivial : 9669
% 0.55/46.74 # Contextual simplify-reflections : 99
% 0.55/46.74 # Paramodulations : 9999
% 0.55/46.74 # Factorizations : 30
% 0.55/46.74 # Equation resolutions : 11
% 0.55/46.74 # Current number of processed clauses : 309
% 0.55/46.74 # Positive orientable unit clauses : 60
% 0.55/46.74 # Positive unorientable unit clauses: 0
% 0.55/46.74 # Negative unit clauses : 34
% 0.55/46.74 # Non-unit-clauses : 215
% 0.55/46.74 # Current number of unprocessed clauses: 7995
% 0.55/46.74 # ...number of literals in the above : 21677
% 0.55/46.74 # Current number of archived formulas : 0
% 0.55/46.74 # Current number of archived clauses : 82
% 0.55/46.74 # Clause-clause subsumption calls (NU) : 17765
% 0.55/46.74 # Rec. Clause-clause subsumption calls : 14146
% 0.55/46.74 # Non-unit clause-clause subsumptions : 165
% 0.55/46.74 # Unit Clause-clause subsumption calls : 5428
% 0.55/46.74 # Rewrite failures with RHS unbound : 0
% 0.55/46.74 # BW rewrite match attempts : 218
% 0.55/46.74 # BW rewrite match successes : 11
% 0.55/46.74 # Condensation attempts : 0
% 0.55/46.74 # Condensation successes : 0
% 0.55/46.74 # Termbank termtop insertions : 104021
% 0.55/46.74
% 0.55/46.74 # -------------------------------------------------
% 0.55/46.74 # User time : 0.134 s
% 0.55/46.74 # System time : 0.006 s
% 0.55/46.74 # Total time : 0.140 s
% 0.55/46.74 # Maximum resident set size: 11864 pages
% 0.55/69.46 eprover: CPU time limit exceeded, terminating
% 0.55/69.47 eprover: CPU time limit exceeded, terminating
% 0.55/69.47 eprover: CPU time limit exceeded, terminating
% 0.55/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.48 eprover: No such file or directory
% 0.55/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.48 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.51 eprover: No such file or directory
% 0.55/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.52 eprover: No such file or directory
% 0.55/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.52 eprover: No such file or directory
% 0.55/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.52 eprover: No such file or directory
% 0.55/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.52 eprover: No such file or directory
% 0.55/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------