TSTP Solution File: SET372+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET372+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:51:00 EDT 2022
% Result : Theorem 1.43s 186.60s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 8 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 110 ( 37 ~; 59 |; 9 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 131 ( 11 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(thI21,conjecture,
! [X1,X2] : equal_set(power_set(intersection(X1,X2)),intersection(power_set(X1),power_set(X2))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI21) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(c_0_5,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_6,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_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_7,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,X5)
| ~ member(X4,intersection(X5,X6)) )
& ( member(X4,X6)
| ~ member(X4,intersection(X5,X6)) )
& ( ~ member(X4,X5)
| ~ member(X4,X6)
| member(X4,intersection(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)],[intersection])])])])]) ).
cnf(c_0_10,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(esk3_2(power_set(X1),X2),X1)
| subset(power_set(X1),X2) ),
inference(pm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| subset(power_set(X2),X3)
| ~ member(X1,esk3_2(power_set(X2),X3)) ),
inference(pm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( member(esk3_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( member(esk3_2(esk3_2(power_set(X1),X2),X3),X1)
| subset(esk3_2(power_set(X1),X2),X3)
| subset(power_set(X1),X2) ),
inference(pm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_17,plain,
( subset(esk3_2(intersection(X1,power_set(X2)),X3),X2)
| subset(intersection(X1,power_set(X2)),X3) ),
inference(pm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
( member(esk3_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( member(esk3_2(esk3_2(power_set(intersection(X1,X2)),X3),X4),X2)
| subset(esk3_2(power_set(intersection(X1,X2)),X3),X4)
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| subset(intersection(X3,power_set(X2)),X4)
| ~ member(X1,esk3_2(intersection(X3,power_set(X2)),X4)) ),
inference(pm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_23,plain,
( subset(esk3_2(intersection(power_set(X1),X2),X3),X1)
| subset(intersection(power_set(X1),X2),X3) ),
inference(pm,[status(thm)],[c_0_7,c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1,X2] : equal_set(power_set(intersection(X1,X2)),intersection(power_set(X1),power_set(X2))),
inference(assume_negation,[status(cth)],[thI21]) ).
cnf(c_0_25,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( subset(esk3_2(power_set(intersection(X1,X2)),X3),X2)
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( member(esk3_2(esk3_2(power_set(intersection(X1,X2)),X3),X4),X1)
| subset(esk3_2(power_set(intersection(X1,X2)),X3),X4)
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_28,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk3_2(X1,intersection(X2,X3)),X3)
| ~ member(esk3_2(X1,intersection(X2,X3)),X2) ),
inference(pm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_29,plain,
( member(esk3_2(esk3_2(intersection(X1,power_set(X2)),X3),X4),X2)
| subset(esk3_2(intersection(X1,power_set(X2)),X3),X4)
| subset(intersection(X1,power_set(X2)),X3) ),
inference(pm,[status(thm)],[c_0_22,c_0_8]) ).
cnf(c_0_30,plain,
( member(X1,X2)
| subset(intersection(power_set(X2),X3),X4)
| ~ member(X1,esk3_2(intersection(power_set(X2),X3),X4)) ),
inference(pm,[status(thm)],[c_0_10,c_0_23]) ).
fof(c_0_31,negated_conjecture,
~ equal_set(power_set(intersection(esk1_0,esk2_0)),intersection(power_set(esk1_0),power_set(esk2_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_32,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_33,plain,
( member(esk3_2(power_set(intersection(X1,X2)),X3),power_set(X2))
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( subset(esk3_2(power_set(intersection(X1,X2)),X3),X1)
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_35,plain,
( subset(esk3_2(intersection(X1,power_set(X2)),X3),intersection(X4,X2))
| subset(intersection(X1,power_set(X2)),X3)
| ~ member(esk3_2(esk3_2(intersection(X1,power_set(X2)),X3),intersection(X4,X2)),X4) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( member(esk3_2(esk3_2(intersection(power_set(X1),X2),X3),X4),X1)
| subset(esk3_2(intersection(power_set(X1),X2),X3),X4)
| subset(intersection(power_set(X1),X2),X3) ),
inference(pm,[status(thm)],[c_0_30,c_0_8]) ).
cnf(c_0_37,negated_conjecture,
~ equal_set(power_set(intersection(esk1_0,esk2_0)),intersection(power_set(esk1_0),power_set(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( subset(power_set(intersection(X1,X2)),intersection(X3,power_set(X2)))
| ~ member(esk3_2(power_set(intersection(X1,X2)),intersection(X3,power_set(X2))),X3) ),
inference(pm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_40,plain,
( member(esk3_2(power_set(intersection(X1,X2)),X3),power_set(X1))
| subset(power_set(intersection(X1,X2)),X3) ),
inference(pm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_41,plain,
( subset(esk3_2(intersection(power_set(X1),power_set(X2)),X3),intersection(X1,X2))
| subset(intersection(power_set(X1),power_set(X2)),X3) ),
inference(pm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ~ subset(intersection(power_set(esk1_0),power_set(esk2_0)),power_set(intersection(esk1_0,esk2_0)))
| ~ subset(power_set(intersection(esk1_0,esk2_0)),intersection(power_set(esk1_0),power_set(esk2_0))) ),
inference(pm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
subset(power_set(intersection(X1,X2)),intersection(power_set(X1),power_set(X2))),
inference(pm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( member(esk3_2(intersection(power_set(X1),power_set(X2)),X3),power_set(intersection(X1,X2)))
| subset(intersection(power_set(X1),power_set(X2)),X3) ),
inference(pm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ subset(intersection(power_set(esk1_0),power_set(esk2_0)),power_set(intersection(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,plain,
subset(intersection(power_set(X1),power_set(X2)),power_set(intersection(X1,X2))),
inference(pm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET372+4 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n006.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 : Sat Jul 9 19:02:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.40 eprover: CPU time limit exceeded, terminating
% 0.37/23.41 eprover: CPU time limit exceeded, terminating
% 0.52/46.42 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/46.45 eprover: CPU time limit exceeded, terminating
% 0.66/69.44 eprover: CPU time limit exceeded, terminating
% 0.66/69.45 eprover: CPU time limit exceeded, terminating
% 0.66/69.47 eprover: CPU time limit exceeded, terminating
% 0.66/69.47 eprover: CPU time limit exceeded, terminating
% 0.82/92.48 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.82/92.48
% 0.82/92.48 eprover: CPU time limit exceeded, terminating
% 0.82/92.49 eprover: CPU time limit exceeded, terminating
% 0.97/115.50 eprover: CPU time limit exceeded, terminating
% 0.97/115.51 eprover: CPU time limit exceeded, terminating
% 0.97/115.51 eprover: CPU time limit exceeded, terminating
% 0.97/115.52 eprover: CPU time limit exceeded, terminating
% 1.12/138.52 eprover: CPU time limit exceeded, terminating
% 1.12/138.53 eprover: CPU time limit exceeded, terminating
% 1.12/138.54 eprover: CPU time limit exceeded, terminating
% 1.12/138.57 eprover: CPU time limit exceeded, terminating
% 1.28/161.55 eprover: CPU time limit exceeded, terminating
% 1.28/161.56 eprover: CPU time limit exceeded, terminating
% 1.28/161.57 eprover: CPU time limit exceeded, terminating
% 1.28/161.58 eprover: CPU time limit exceeded, terminating
% 1.43/184.58 eprover: CPU time limit exceeded, terminating
% 1.43/184.58 eprover: CPU time limit exceeded, terminating
% 1.43/184.59 eprover: CPU time limit exceeded, terminating
% 1.43/184.60 eprover: CPU time limit exceeded, terminating
% 1.43/186.60 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # Preprocessing time : 0.016 s
% 1.43/186.60 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.43/186.60 # Preprocessing time : 0.014 s
% 1.43/186.60 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # Preprocessing time : 0.010 s
% 1.43/186.60 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # Preprocessing time : 0.009 s
% 1.43/186.60 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # Preprocessing time : 0.009 s
% 1.43/186.60 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.43/186.60 # Preprocessing time : 0.007 s
% 1.43/186.60 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.43/186.60 # Preprocessing time : 0.007 s
% 1.43/186.60 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 1.43/186.60
% 1.43/186.60 # Failure: Resource limit exceeded (time)
% 1.43/186.60 # OLD status Res
% 1.43/186.60 # Preprocessing time : 0.010 s
% 1.43/186.60 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 1.43/186.60 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 1.43/186.60 # Preprocessing time : 0.007 s
% 1.43/186.60
% 1.43/186.60 # Proof found!
% 1.43/186.60 # SZS status Theorem
% 1.43/186.60 # SZS output start CNFRefutation
% See solution above
% 1.43/186.60 # Proof object total steps : 48
% 1.43/186.60 # Proof object clause steps : 37
% 1.43/186.60 # Proof object formula steps : 11
% 1.43/186.60 # Proof object conjectures : 7
% 1.43/186.60 # Proof object clause conjectures : 4
% 1.43/186.60 # Proof object formula conjectures : 3
% 1.43/186.60 # Proof object initial clauses used : 10
% 1.43/186.60 # Proof object initial formulas used : 5
% 1.43/186.60 # Proof object generating inferences : 25
% 1.43/186.60 # Proof object simplifying inferences : 4
% 1.43/186.60 # Training examples: 0 positive, 0 negative
% 1.43/186.60 # Parsed axioms : 12
% 1.43/186.60 # Removed by relevancy pruning/SinE : 7
% 1.43/186.60 # Initial clauses : 12
% 1.43/186.60 # Removed in clause preprocessing : 0
% 1.43/186.60 # Initial clauses in saturation : 12
% 1.43/186.60 # Processed clauses : 3584
% 1.43/186.60 # ...of these trivial : 6
% 1.43/186.60 # ...subsumed : 357
% 1.43/186.60 # ...remaining for further processing : 3221
% 1.43/186.60 # Other redundant clauses eliminated : 0
% 1.43/186.60 # Clauses deleted for lack of memory : 67307
% 1.43/186.60 # Backward-subsumed : 0
% 1.43/186.60 # Backward-rewritten : 2
% 1.43/186.60 # Generated clauses : 151115
% 1.43/186.60 # ...of the previous two non-trivial : 148637
% 1.43/186.60 # Contextual simplify-reflections : 0
% 1.43/186.60 # Paramodulations : 151115
% 1.43/186.60 # Factorizations : 0
% 1.43/186.60 # Equation resolutions : 0
% 1.43/186.60 # Current number of processed clauses : 3219
% 1.43/186.60 # Positive orientable unit clauses : 1900
% 1.43/186.60 # Positive unorientable unit clauses: 0
% 1.43/186.60 # Negative unit clauses : 1
% 1.43/186.60 # Non-unit-clauses : 1318
% 1.43/186.60 # Current number of unprocessed clauses: 77758
% 1.43/186.60 # ...number of literals in the above : 171656
% 1.43/186.60 # Current number of archived formulas : 0
% 1.43/186.60 # Current number of archived clauses : 2
% 1.43/186.60 # Clause-clause subsumption calls (NU) : 275250
% 1.43/186.60 # Rec. Clause-clause subsumption calls : 120579
% 1.43/186.60 # Non-unit clause-clause subsumptions : 357
% 1.43/186.60 # Unit Clause-clause subsumption calls : 406039
% 1.43/186.60 # Rewrite failures with RHS unbound : 0
% 1.43/186.60 # BW rewrite match attempts : 221764
% 1.43/186.60 # BW rewrite match successes : 2
% 1.43/186.60 # Condensation attempts : 0
% 1.43/186.60 # Condensation successes : 0
% 1.43/186.60 # Termbank termtop insertions : 4884627
% 1.43/186.60
% 1.43/186.60 # -------------------------------------------------
% 1.43/186.60 # User time : 1.905 s
% 1.43/186.60 # System time : 0.061 s
% 1.43/186.60 # Total time : 1.966 s
% 1.43/186.60 # Maximum resident set size: 131124 pages
% 1.43/207.60 eprover: CPU time limit exceeded, terminating
% 1.43/207.60 eprover: CPU time limit exceeded, terminating
% 1.43/207.62 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.43/207.62 eprover: No such file or directory
% 1.43/207.63 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.43/207.63 eprover: No such file or directory
% 1.43/207.63 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.43/207.63 eprover: No such file or directory
% 1.43/207.63 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.43/207.63 eprover: No such file or directory
% 1.43/207.63 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.43/207.63 eprover: No such file or directory
% 1.43/207.63 eprover: CPU time limit exceeded, terminating
% 1.43/207.65 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.43/207.65 eprover: No such file or directory
% 1.43/207.66 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.43/207.66 eprover: No such file or directory
% 1.43/207.66 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.43/207.66 eprover: No such file or directory
%------------------------------------------------------------------------------