TSTP Solution File: SWC390+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC390+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:27 EDT 2022
% Result : Theorem 0.46s 47.65s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 64 ( 12 unt; 0 def)
% Number of atoms : 254 ( 58 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 324 ( 134 ~; 132 |; 31 &)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 41 !; 5 ?)
% 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)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
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(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
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(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(c_0_9,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)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,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) )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,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_9])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,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_16,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( neq(esk4_0,nil)
| ~ segmentP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ segmentP(esk4_0,esk1_0) ),
inference(pm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_26,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_17,c_0_20]),c_0_21]),c_0_22])]) ).
fof(c_0_27,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(esk5_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(pm,[status(thm)],[c_0_23,c_0_18]) ).
fof(c_0_29,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_30,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ segmentP(esk4_0,nil) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(esk5_0)
| esk4_0 != nil
| ~ segmentP(esk4_0,nil) ),
inference(pm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_33,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_23,c_0_20]),c_0_21]),c_0_22])]) ).
fof(c_0_34,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk7_2(X5,X6),X6),esk8_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_35,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_36,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk9_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk10_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk9_2(X5,X6),cons(X6,esk10_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_37,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).
cnf(c_0_39,negated_conjecture,
ssItem(esk5_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_32,c_0_31]),c_0_22])]),c_0_33]) ).
cnf(c_0_40,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_34]) ).
cnf(c_0_41,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( app(esk9_2(X1,X2),cons(X2,esk10_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,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_37,c_0_38]),c_0_39])]) ).
fof(c_0_44,plain,
! [X3,X5] :
( ( ssItem(esk6_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk6_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) ) ),
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)],[ax4])])])])])])]) ).
cnf(c_0_45,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(pm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( app(esk9_2(X1,esk5_0),app(esk1_0,esk10_2(X1,esk5_0))) = X1
| ~ memberP(X1,esk5_0)
| ~ ssList(esk10_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_43]),c_0_39])]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_49,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ singletonP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_50,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk10_2(X1,esk5_0))
| ~ ssList(esk9_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_46]),c_0_47])])]) ).
cnf(c_0_52,plain,
( ssList(esk10_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(pm,[status(thm)],[c_0_48,c_0_18]) ).
cnf(c_0_54,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ singletonP(esk1_0) ),
inference(rw,[status(thm)],[c_0_49,c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( singletonP(X1)
| esk1_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_50,c_0_38]),c_0_39])]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk9_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_51,c_0_52]),c_0_39])]) ).
cnf(c_0_57,plain,
( ssList(esk9_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_58,negated_conjecture,
( memberP(esk4_0,esk5_0)
| esk4_0 != nil
| ~ segmentP(esk4_0,nil) ),
inference(pm,[status(thm)],[c_0_53,c_0_25]) ).
cnf(c_0_59,negated_conjecture,
( esk4_0 = nil
| memberP(esk4_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_60,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_54,c_0_55]),c_0_47])]) ).
cnf(c_0_61,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_56,c_0_57]),c_0_39])]) ).
cnf(c_0_62,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_58,c_0_31]),c_0_22])]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC390+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n014.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 12 00:25:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.42 eprover: CPU time limit exceeded, terminating
% 0.34/23.42 eprover: CPU time limit exceeded, terminating
% 0.46/46.43 eprover: CPU time limit exceeded, terminating
% 0.46/46.43 eprover: CPU time limit exceeded, terminating
% 0.46/46.44 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.46/46.44
% 0.46/47.65 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.46/47.65
% 0.46/47.65 # Failure: Resource limit exceeded (time)
% 0.46/47.65 # OLD status Res
% 0.46/47.65 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.46/47.65 # Preprocessing time : 0.019 s
% 0.46/47.65 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.46/47.65
% 0.46/47.65 # Failure: Resource limit exceeded (time)
% 0.46/47.65 # OLD status Res
% 0.46/47.65 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.46/47.65 # Preprocessing time : 0.019 s
% 0.46/47.65 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.46/47.65 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.46/47.65 # Preprocessing time : 0.019 s
% 0.46/47.65
% 0.46/47.65 # Proof found!
% 0.46/47.65 # SZS status Theorem
% 0.46/47.65 # SZS output start CNFRefutation
% See solution above
% 0.46/47.65 # Proof object total steps : 64
% 0.46/47.65 # Proof object clause steps : 46
% 0.46/47.65 # Proof object formula steps : 18
% 0.46/47.65 # Proof object conjectures : 38
% 0.46/47.65 # Proof object clause conjectures : 35
% 0.46/47.65 # Proof object formula conjectures : 3
% 0.46/47.65 # Proof object initial clauses used : 20
% 0.46/47.65 # Proof object initial formulas used : 9
% 0.46/47.65 # Proof object generating inferences : 21
% 0.46/47.65 # Proof object simplifying inferences : 42
% 0.46/47.65 # Training examples: 0 positive, 0 negative
% 0.46/47.65 # Parsed axioms : 96
% 0.46/47.65 # Removed by relevancy pruning/SinE : 64
% 0.46/47.65 # Initial clauses : 65
% 0.46/47.65 # Removed in clause preprocessing : 0
% 0.46/47.65 # Initial clauses in saturation : 65
% 0.46/47.65 # Processed clauses : 3221
% 0.46/47.65 # ...of these trivial : 29
% 0.46/47.65 # ...subsumed : 2724
% 0.46/47.65 # ...remaining for further processing : 468
% 0.46/47.65 # Other redundant clauses eliminated : 61
% 0.46/47.65 # Clauses deleted for lack of memory : 0
% 0.46/47.65 # Backward-subsumed : 20
% 0.46/47.65 # Backward-rewritten : 28
% 0.46/47.65 # Generated clauses : 10084
% 0.46/47.65 # ...of the previous two non-trivial : 9096
% 0.46/47.65 # Contextual simplify-reflections : 417
% 0.46/47.65 # Paramodulations : 9984
% 0.46/47.65 # Factorizations : 0
% 0.46/47.65 # Equation resolutions : 100
% 0.46/47.65 # Current number of processed clauses : 417
% 0.46/47.65 # Positive orientable unit clauses : 77
% 0.46/47.65 # Positive unorientable unit clauses: 0
% 0.46/47.65 # Negative unit clauses : 76
% 0.46/47.65 # Non-unit-clauses : 264
% 0.46/47.65 # Current number of unprocessed clauses: 5742
% 0.46/47.65 # ...number of literals in the above : 32041
% 0.46/47.65 # Current number of archived formulas : 0
% 0.46/47.65 # Current number of archived clauses : 48
% 0.46/47.65 # Clause-clause subsumption calls (NU) : 25244
% 0.46/47.65 # Rec. Clause-clause subsumption calls : 8003
% 0.46/47.65 # Non-unit clause-clause subsumptions : 720
% 0.46/47.65 # Unit Clause-clause subsumption calls : 636
% 0.46/47.65 # Rewrite failures with RHS unbound : 0
% 0.46/47.65 # BW rewrite match attempts : 122
% 0.46/47.65 # BW rewrite match successes : 16
% 0.46/47.65 # Condensation attempts : 0
% 0.46/47.65 # Condensation successes : 0
% 0.46/47.65 # Termbank termtop insertions : 133029
% 0.46/47.65
% 0.46/47.65 # -------------------------------------------------
% 0.46/47.65 # User time : 0.206 s
% 0.46/47.65 # System time : 0.012 s
% 0.46/47.65 # Total time : 0.218 s
% 0.46/47.65 # Maximum resident set size: 9672 pages
% 0.46/69.44 eprover: CPU time limit exceeded, terminating
% 0.46/69.45 eprover: CPU time limit exceeded, terminating
% 0.46/69.45 eprover: CPU time limit exceeded, terminating
% 0.46/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.46 eprover: No such file or directory
% 0.46/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.46 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.49 eprover: No such file or directory
% 0.46/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.50 eprover: No such file or directory
% 0.46/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.50 eprover: No such file or directory
% 0.46/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.46/69.50 eprover: No such file or directory
% 0.46/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.50 eprover: No such file or directory
% 0.46/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.51 eprover: No such file or directory
%------------------------------------------------------------------------------