TSTP Solution File: SWC247+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC247+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:27:35 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 16 unt; 0 def)
% Number of atoms : 283 ( 71 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 368 ( 151 ~; 147 |; 36 &)
% ( 2 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 112 ( 0 sgn 51 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,negated_conjecture,
! [X14,X15,X16,X17] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& frontsegP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& nil != esk1_0
& ( ~ ssList(X14)
| ~ neq(esk3_0,X14)
| ~ frontsegP(esk4_0,X14)
| ~ segmentP(X14,esk3_0)
| ~ totalorderedP(X14) )
& ( ssItem(esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X16,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X17,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( lt(X15,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ leq(X15,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_13])])])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,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)],[ax16])])])])]) ).
fof(c_0_16,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])])])])]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
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)],[ax27])])])])]) ).
fof(c_0_18,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(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)],[ax93])])])])])]) ).
cnf(c_0_20,negated_conjecture,
( lt(X1,esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ~ leq(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(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)],[ax85])])])])]) ).
fof(c_0_30,plain,
! [X4,X5,X7] :
( ( ssList(esk19_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk19_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(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)],[ax5])])])])])])]) ).
cnf(c_0_31,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( lt(X1,esk5_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk3_0
| ~ leq(X2,esk5_3(X2,X1,X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
fof(c_0_35,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_36,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_37,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_38,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( app(X2,esk19_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( ssList(esk19_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_46,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28])]) ).
fof(c_0_48,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_49,plain,
( hd(X1) = hd(X2)
| nil = X2
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_50,negated_conjecture,
frontsegP(esk2_0,esk3_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_53,negated_conjecture,
nil != esk3_0,
inference(rw,[status(thm)],[c_0_44,c_0_21]) ).
fof(c_0_54,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(X1,nil),X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28])]),c_0_47]) ).
cnf(c_0_56,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,negated_conjecture,
hd(esk3_0) = hd(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]),c_0_53]) ).
cnf(c_0_58,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( cons(X1,X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_25]) ).
cnf(c_0_60,negated_conjecture,
cons(hd(esk2_0),tl(esk3_0)) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_51])]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
ssItem(hd(esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_51])]),c_0_53]) ).
fof(c_0_62,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_63,negated_conjecture,
~ ssList(tl(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_64,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_51])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC247+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 12:53:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.026 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 66
% 0.23/1.41 # Proof object clause steps : 40
% 0.23/1.41 # Proof object formula steps : 26
% 0.23/1.41 # Proof object conjectures : 26
% 0.23/1.41 # Proof object clause conjectures : 23
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 22
% 0.23/1.41 # Proof object initial formulas used : 13
% 0.23/1.41 # Proof object generating inferences : 12
% 0.23/1.41 # Proof object simplifying inferences : 31
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 96
% 0.23/1.41 # Removed by relevancy pruning/SinE : 35
% 0.23/1.41 # Initial clauses : 115
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 114
% 0.23/1.41 # Processed clauses : 731
% 0.23/1.41 # ...of these trivial : 6
% 0.23/1.41 # ...subsumed : 409
% 0.23/1.41 # ...remaining for further processing : 316
% 0.23/1.41 # Other redundant clauses eliminated : 68
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 14
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 5611
% 0.23/1.41 # ...of the previous two non-trivial : 5035
% 0.23/1.41 # Contextual simplify-reflections : 340
% 0.23/1.41 # Paramodulations : 5516
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 95
% 0.23/1.41 # Current number of processed clauses : 295
% 0.23/1.41 # Positive orientable unit clauses : 15
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 9
% 0.23/1.41 # Non-unit-clauses : 271
% 0.23/1.41 # Current number of unprocessed clauses: 4324
% 0.23/1.41 # ...number of literals in the above : 28477
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 16
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 18543
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 5410
% 0.23/1.41 # Non-unit clause-clause subsumptions : 717
% 0.23/1.41 # Unit Clause-clause subsumption calls : 155
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 107431
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.301 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.305 s
% 0.23/1.41 # Maximum resident set size: 7804 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------