TSTP Solution File: SET919+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET919+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:55:26 EDT 2022
% Result : Theorem 1.15s 118.33s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 15 unt; 0 def)
% Number of atoms : 173 ( 103 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 174 ( 55 ~; 93 |; 18 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 134 ( 16 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d1_tarski) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d3_xboole_0) ).
fof(t60_zfmisc_1,conjecture,
! [X1,X2,X3] :
( in(X1,X2)
=> ( ( in(X3,X2)
& X1 != X3 )
| set_intersection2(unordered_pair(X1,X3),X2) = singleton(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t60_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d2_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_k2_tarski) ).
fof(c_0_6,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) = X4
| X5 = singleton(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)],[d1_tarski])])])])])])]) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X7)
| ~ in(esk3_3(X5,X6,X7),X5)
| ~ in(esk3_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_8,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ in(X2,singleton(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( set_intersection2(X1,X2) = X2
| in(esk3_3(X1,X2,X2),X2) ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2,X3] :
( in(X1,X2)
=> ( ( in(X3,X2)
& X1 != X3 )
| set_intersection2(unordered_pair(X1,X3),X2) = singleton(X1) ) ),
inference(assume_negation,[status(cth)],[t60_zfmisc_1]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk2_3(X5,X6,X7) != X5
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk2_3(X5,X6,X7) != X6
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk2_3(X5,X6,X7),X7)
| esk2_3(X5,X6,X7) = X5
| esk2_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
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)],[d2_tarski])])])])])])]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2)
| ~ in(esk3_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( esk3_3(X1,singleton(X2),singleton(X2)) = X2
| set_intersection2(X1,singleton(X2)) = singleton(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_22,negated_conjecture,
( in(esk6_0,esk7_0)
& ( ~ in(esk8_0,esk7_0)
| esk6_0 = esk8_0 )
& set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0) != singleton(esk6_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_23,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( set_intersection2(X1,X2) = set_intersection2(X3,X4)
| in(esk3_3(X3,X4,set_intersection2(X1,X2)),X1)
| in(esk3_3(X3,X4,set_intersection2(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( set_intersection2(X1,singleton(X2)) = singleton(X2)
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
in(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X3,X1)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( esk3_3(X1,X2,singleton(X3)) = X3
| singleton(X3) = set_intersection2(X1,X2)
| in(esk3_3(X1,X2,singleton(X3)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_29,plain,
( set_intersection2(X1,X2) = set_intersection2(X1,X3)
| in(esk3_3(X1,X3,set_intersection2(X1,X2)),X1) ),
inference(ef,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
set_intersection2(esk7_0,singleton(esk6_0)) = singleton(esk6_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( esk3_3(X1,unordered_pair(X2,X3),singleton(X4)) = X3
| esk3_3(X1,unordered_pair(X2,X3),singleton(X4)) = X2
| esk3_3(X1,unordered_pair(X2,X3),singleton(X4)) = X4
| singleton(X4) = set_intersection2(X1,unordered_pair(X2,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,plain,
( X1 = unordered_pair(X2,X3)
| esk2_3(X2,X3,X1) = X3
| esk2_3(X2,X3,X1) = X2
| in(esk2_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( set_intersection2(esk7_0,X1) = singleton(esk6_0)
| in(esk3_3(esk7_0,X1,singleton(esk6_0)),esk7_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( esk3_3(X1,unordered_pair(X2,X3),singleton(X3)) = X2
| esk3_3(X1,unordered_pair(X2,X3),singleton(X3)) = X3
| set_intersection2(X1,unordered_pair(X2,X3)) = singleton(X3) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_31])]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_38,plain,
( esk2_3(X1,X2,singleton(X3)) = X3
| esk2_3(X1,X2,singleton(X3)) = X2
| esk2_3(X1,X2,singleton(X3)) = X1
| singleton(X3) = unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( esk3_3(esk7_0,unordered_pair(X1,esk6_0),singleton(esk6_0)) = esk6_0
| set_intersection2(esk7_0,unordered_pair(X1,esk6_0)) = singleton(esk6_0)
| in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_36]) ).
fof(c_0_41,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_42,negated_conjecture,
set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0) != singleton(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_43,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk2_3(X2,X3,X1),X1)
| esk2_3(X2,X3,X1) != X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,plain,
( esk2_3(X1,X2,singleton(X2)) = X2
| esk2_3(X1,X2,singleton(X2)) = X1
| unordered_pair(X1,X2) = singleton(X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = esk8_0
| ~ in(esk8_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_47,negated_conjecture,
( set_intersection2(esk7_0,unordered_pair(X1,esk6_0)) = singleton(esk6_0)
| in(X1,esk7_0) ),
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_39]),c_0_40]),c_0_26]),c_0_21])]) ).
cnf(c_0_48,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)) != singleton(esk6_0),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( esk2_3(X1,X2,singleton(X2)) = X1
| unordered_pair(X1,X2) = singleton(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_21])]) ).
cnf(c_0_51,negated_conjecture,
esk8_0 = esk6_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_50])]),c_0_21])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_51]),c_0_52]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET919+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.15/0.37 % Computer : n023.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sat Jul 9 19:05:40 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.43/23.45 eprover: CPU time limit exceeded, terminating
% 0.43/23.45 eprover: CPU time limit exceeded, terminating
% 0.43/23.46 eprover: CPU time limit exceeded, terminating
% 0.43/23.47 eprover: CPU time limit exceeded, terminating
% 0.61/46.47 eprover: CPU time limit exceeded, terminating
% 0.61/46.47 eprover: CPU time limit exceeded, terminating
% 0.61/46.48 eprover: CPU time limit exceeded, terminating
% 0.61/46.48 eprover: CPU time limit exceeded, terminating
% 0.78/69.48 eprover: CPU time limit exceeded, terminating
% 0.78/69.49 eprover: CPU time limit exceeded, terminating
% 0.78/69.49 eprover: CPU time limit exceeded, terminating
% 0.78/69.51 eprover: CPU time limit exceeded, terminating
% 0.96/92.51 eprover: CPU time limit exceeded, terminating
% 0.96/92.51 eprover: CPU time limit exceeded, terminating
% 0.96/92.52 eprover: CPU time limit exceeded, terminating
% 0.96/92.55 eprover: CPU time limit exceeded, terminating
% 1.13/115.54 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.13/115.54
% 1.13/115.54 eprover: CPU time limit exceeded, terminating
% 1.13/115.59 eprover: CPU time limit exceeded, terminating
% 1.15/118.33 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.15/118.33
% 1.15/118.33 # Failure: Resource limit exceeded (time)
% 1.15/118.33 # OLD status Res
% 1.15/118.33 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.15/118.33 # Preprocessing time : 0.016 s
% 1.15/118.33 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.15/118.33
% 1.15/118.33 # Failure: Resource limit exceeded (time)
% 1.15/118.33 # OLD status Res
% 1.15/118.33 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.15/118.33 # Preprocessing time : 0.008 s
% 1.15/118.33 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 1.15/118.33
% 1.15/118.33 # Failure: Resource limit exceeded (time)
% 1.15/118.33 # OLD status Res
% 1.15/118.33 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 1.15/118.33 # Preprocessing time : 0.008 s
% 1.15/118.33 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 1.15/118.33
% 1.15/118.33 # Failure: Resource limit exceeded (time)
% 1.15/118.33 # OLD status Res
% 1.15/118.33 # Preprocessing time : 0.015 s
% 1.15/118.33 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 1.15/118.33
% 1.15/118.33 # Failure: Resource limit exceeded (time)
% 1.15/118.33 # OLD status Res
% 1.15/118.33 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 1.15/118.33 # Preprocessing time : 0.014 s
% 1.15/118.33 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 1.15/118.33 # Preprocessing time : 0.015 s
% 1.15/118.33
% 1.15/118.33 # Proof found!
% 1.15/118.33 # SZS status Theorem
% 1.15/118.33 # SZS output start CNFRefutation
% See solution above
% 1.15/118.33 # Proof object total steps : 54
% 1.15/118.33 # Proof object clause steps : 41
% 1.15/118.33 # Proof object formula steps : 13
% 1.15/118.33 # Proof object conjectures : 13
% 1.15/118.33 # Proof object clause conjectures : 10
% 1.15/118.33 # Proof object formula conjectures : 3
% 1.15/118.33 # Proof object initial clauses used : 15
% 1.15/118.33 # Proof object initial formulas used : 6
% 1.15/118.33 # Proof object generating inferences : 22
% 1.15/118.33 # Proof object simplifying inferences : 22
% 1.15/118.33 # Training examples: 0 positive, 0 negative
% 1.15/118.33 # Parsed axioms : 10
% 1.15/118.33 # Removed by relevancy pruning/SinE : 0
% 1.15/118.33 # Initial clauses : 25
% 1.15/118.33 # Removed in clause preprocessing : 0
% 1.15/118.33 # Initial clauses in saturation : 25
% 1.15/118.33 # Processed clauses : 7680
% 1.15/118.33 # ...of these trivial : 755
% 1.15/118.33 # ...subsumed : 4997
% 1.15/118.33 # ...remaining for further processing : 1928
% 1.15/118.33 # Other redundant clauses eliminated : 319
% 1.15/118.33 # Clauses deleted for lack of memory : 0
% 1.15/118.33 # Backward-subsumed : 32
% 1.15/118.33 # Backward-rewritten : 638
% 1.15/118.33 # Generated clauses : 235023
% 1.15/118.33 # ...of the previous two non-trivial : 208795
% 1.15/118.33 # Contextual simplify-reflections : 0
% 1.15/118.33 # Paramodulations : 234121
% 1.15/118.33 # Factorizations : 470
% 1.15/118.33 # Equation resolutions : 432
% 1.15/118.33 # Current number of processed clauses : 1255
% 1.15/118.33 # Positive orientable unit clauses : 107
% 1.15/118.33 # Positive unorientable unit clauses: 4
% 1.15/118.33 # Negative unit clauses : 70
% 1.15/118.33 # Non-unit-clauses : 1074
% 1.15/118.33 # Current number of unprocessed clauses: 135972
% 1.15/118.33 # ...number of literals in the above : 530269
% 1.15/118.33 # Current number of archived formulas : 0
% 1.15/118.33 # Current number of archived clauses : 670
% 1.15/118.33 # Clause-clause subsumption calls (NU) : 90148
% 1.15/118.33 # Rec. Clause-clause subsumption calls : 35909
% 1.15/118.33 # Non-unit clause-clause subsumptions : 3327
% 1.15/118.33 # Unit Clause-clause subsumption calls : 9485
% 1.15/118.33 # Rewrite failures with RHS unbound : 9
% 1.15/118.33 # BW rewrite match attempts : 4937
% 1.15/118.33 # BW rewrite match successes : 113
% 1.15/118.33 # Condensation attempts : 0
% 1.15/118.33 # Condensation successes : 0
% 1.15/118.33 # Termbank termtop insertions : 5098083
% 1.15/118.33
% 1.15/118.33 # -------------------------------------------------
% 1.15/118.33 # User time : 1.870 s
% 1.15/118.33 # System time : 0.062 s
% 1.15/118.33 # Total time : 1.932 s
% 1.15/118.33 # Maximum resident set size: 117080 pages
% 1.17/138.56 eprover: CPU time limit exceeded, terminating
% 1.17/138.56 eprover: CPU time limit exceeded, terminating
% 1.17/138.58 eprover: CPU time limit exceeded, terminating
% 1.17/138.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.58 eprover: No such file or directory
% 1.17/138.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.59 eprover: No such file or directory
% 1.17/138.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.59 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.60 eprover: No such file or directory
% 1.17/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.61 eprover: No such file or directory
% 1.17/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.61 eprover: No such file or directory
% 1.17/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.17/138.61 eprover: No such file or directory
% 1.17/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.61 eprover: No such file or directory
% 1.17/138.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.61 eprover: No such file or directory
% 1.17/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.62 eprover: No such file or directory
% 1.17/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.62 eprover: No such file or directory
% 1.17/138.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.17/138.62 eprover: No such file or directory
%------------------------------------------------------------------------------