%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC341+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 20:28:09 EDT 2022
% Result : Theorem 0.49s 47.66s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 16 unt; 0 def)
% Number of atoms : 254 ( 60 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 330 ( 136 ~; 133 |; 33 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 42 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax67,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( totalorderedP(cons(X1,X2))
<=> ( nil = X2
| ( nil != X2
& totalorderedP(X2)
& leq(X1,hd(X2)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax67) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ) ),
inference(distribute,[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)],[inference(fof_simplification,[status(thm)],[c_0_10])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax15])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( esk4_0 != nil
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk4_0,nil) ),
inference(pm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_26,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,negated_conjecture,
( esk4_0 != nil
| ~ totalorderedP(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
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)],[ax81])])])])]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_17]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
( esk4_0 = nil
| ssItem(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_26]),c_0_27]),c_0_24])]) ).
fof(c_0_35,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk11_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk12_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk11_2(X5,X6),X6),esk12_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(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)],[ax7])])])])])])]) ).
fof(c_0_36,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
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)],[ax82])])])])]) ).
fof(c_0_37,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk13_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk14_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk13_2(X5,X6),cons(X6,esk14_2(X5,X6))) = X5
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(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)],[ax3])])])])])])]) ).
cnf(c_0_38,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_41,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( app(esk13_2(X1,X2),cons(X2,esk14_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( cons(esk5_0,X1) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ( nil != X4
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( totalorderedP(X4)
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( leq(X3,hd(X4))
| nil = X4
| ~ totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( nil != X4
| totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) )
& ( nil = X4
| ~ totalorderedP(X4)
| ~ leq(X3,hd(X4))
| totalorderedP(cons(X3,X4))
| ~ ssList(X4)
| ~ ssItem(X3) ) ),
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)],[ax67])])])])])]) ).
cnf(c_0_46,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(pm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( app(esk13_2(X1,esk5_0),app(esk1_0,esk14_2(X1,esk5_0))) = X1
| ~ memberP(X1,esk5_0)
| ~ ssList(esk14_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_44]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,plain,
( totalorderedP(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk14_2(X1,esk5_0))
| ~ ssList(esk13_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_48])])]) ).
cnf(c_0_51,plain,
( ssList(esk14_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_52,negated_conjecture,
totalorderedP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_49,c_0_39]),c_0_27]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk13_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_50,c_0_51]),c_0_40])]) ).
cnf(c_0_54,plain,
( ssList(esk13_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_56,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ memberP(X1,esk5_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_53,c_0_54]),c_0_40])]) ).
cnf(c_0_58,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_26]),c_0_27]),c_0_24])]),c_0_33]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC341+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.14/0.33 % Computer : n011.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 11:37:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.48/46.43 eprover: CPU time limit exceeded, terminating
% 0.48/46.43 eprover: CPU time limit exceeded, terminating
% 0.48/46.43 eprover: CPU time limit exceeded, terminating
% 0.48/46.45 eprover: CPU time limit exceeded, terminating
% 0.49/47.66 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.49/47.66
% 0.49/47.66 # Failure: Resource limit exceeded (time)
% 0.49/47.66 # OLD status Res
% 0.49/47.66 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.49/47.66 # Preprocessing time : 0.020 s
% 0.49/47.66 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.49/47.66
% 0.49/47.66 # Failure: Resource limit exceeded (time)
% 0.49/47.66 # OLD status Res
% 0.49/47.66 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.49/47.66 # Preprocessing time : 0.019 s
% 0.49/47.66 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.49/47.66 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.49/47.66 # Preprocessing time : 0.021 s
% 0.49/47.66
% 0.49/47.66 # Proof found!
% 0.49/47.66 # SZS status Theorem
% 0.49/47.66 # SZS output start CNFRefutation
% See solution above
% 0.49/47.66 # Proof object total steps : 60
% 0.49/47.66 # Proof object clause steps : 41
% 0.49/47.66 # Proof object formula steps : 19
% 0.49/47.66 # Proof object conjectures : 32
% 0.49/47.66 # Proof object clause conjectures : 29
% 0.49/47.66 # Proof object formula conjectures : 3
% 0.49/47.66 # Proof object initial clauses used : 20
% 0.49/47.66 # Proof object initial formulas used : 10
% 0.49/47.66 # Proof object generating inferences : 14
% 0.49/47.66 # Proof object simplifying inferences : 39
% 0.49/47.66 # Training examples: 0 positive, 0 negative
% 0.49/47.66 # Parsed axioms : 96
% 0.49/47.66 # Removed by relevancy pruning/SinE : 49
% 0.49/47.66 # Initial clauses : 91
% 0.49/47.66 # Removed in clause preprocessing : 1
% 0.49/47.66 # Initial clauses in saturation : 90
% 0.49/47.66 # Processed clauses : 4664
% 0.49/47.66 # ...of these trivial : 39
% 0.49/47.66 # ...subsumed : 3975
% 0.49/47.66 # ...remaining for further processing : 650
% 0.49/47.66 # Other redundant clauses eliminated : 77
% 0.49/47.66 # Clauses deleted for lack of memory : 0
% 0.49/47.66 # Backward-subsumed : 29
% 0.49/47.66 # Backward-rewritten : 67
% 0.49/47.66 # Generated clauses : 14976
% 0.49/47.66 # ...of the previous two non-trivial : 13317
% 0.49/47.66 # Contextual simplify-reflections : 720
% 0.49/47.66 # Paramodulations : 14851
% 0.49/47.66 # Factorizations : 0
% 0.49/47.66 # Equation resolutions : 123
% 0.49/47.66 # Current number of processed clauses : 548
% 0.49/47.66 # Positive orientable unit clauses : 75
% 0.49/47.66 # Positive unorientable unit clauses: 0
% 0.49/47.66 # Negative unit clauses : 63
% 0.49/47.66 # Non-unit-clauses : 410
% 0.49/47.66 # Current number of unprocessed clauses: 8381
% 0.49/47.66 # ...number of literals in the above : 52457
% 0.49/47.66 # Current number of archived formulas : 0
% 0.49/47.66 # Current number of archived clauses : 98
% 0.49/47.66 # Clause-clause subsumption calls (NU) : 63751
% 0.49/47.66 # Rec. Clause-clause subsumption calls : 18997
% 0.49/47.66 # Non-unit clause-clause subsumptions : 1334
% 0.49/47.66 # Unit Clause-clause subsumption calls : 1626
% 0.49/47.66 # Rewrite failures with RHS unbound : 0
% 0.49/47.66 # BW rewrite match attempts : 96
% 0.49/47.66 # BW rewrite match successes : 28
% 0.49/47.66 # Condensation attempts : 0
% 0.49/47.66 # Condensation successes : 0
% 0.49/47.66 # Termbank termtop insertions : 189997
% 0.49/47.66
% 0.49/47.66 # -------------------------------------------------
% 0.49/47.66 # User time : 0.297 s
% 0.49/47.66 # System time : 0.008 s
% 0.49/47.66 # Total time : 0.305 s
% 0.49/47.66 # Maximum resident set size: 12612 pages
% 0.49/69.46 eprover: CPU time limit exceeded, terminating
% 0.49/69.46 eprover: CPU time limit exceeded, terminating
% 0.49/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.48 eprover: No such file or directory
% 0.49/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.48 eprover: No such file or directory
% 0.49/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.48 eprover: No such file or directory
% 0.49/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.48 eprover: No such file or directory
% 0.49/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.48 eprover: No such file or directory
% 0.49/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.49 eprover: No such file or directory
% 0.49/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.49 eprover: No such file or directory
% 0.49/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.49 eprover: No such file or directory
% 0.49/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.49 eprover: No such file or directory
% 0.49/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.50 eprover: No such file or directory
% 0.49/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.50 eprover: No such file or directory
% 0.49/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.50 eprover: No such file or directory
% 0.49/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.50 eprover: No such file or directory
% 0.49/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/69.51 eprover: No such file or directory
% 0.49/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.51 eprover: No such file or directory
% 0.49/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.51 eprover: No such file or directory
% 0.49/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.52 eprover: No such file or directory
% 0.49/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.49/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------