TSTP Solution File: GEO340+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO340+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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 : Sat Jul 16 04:05:30 EDT 2022
% Result : Theorem 1.13s 116.29s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 52 ( 30 unt; 0 def)
% Number of atoms : 251 ( 124 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 335 ( 136 ~; 130 |; 64 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-7 aty)
% Number of variables : 101 ( 3 sgn 39 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(404), 0), 0)',axiom,
! [X5,X6,X7,X8,X9] :
( ( X8 = X9
& ron(X6,X8)
& ron(X5,X8)
& rline(X9)
& X6 != X7
& X5 != X7
& X5 != X6
& ? [X10] :
( X7 = X10
& rpoint(X10) )
& ? [X11] :
( X6 = X11
& rpoint(X11) )
& ? [X12] :
( X5 = X12
& rpoint(X12) ) )
=> ! [X13] :
( ( X13 != X7
& vf(X6,X7) = vf(X6,X13)
& vf(X5,X7) = vf(X5,X13)
& rS(X7,X13,X8)
& rpoint(X13) )
=> ! [X14] :
( X14 = vskolem1416(X13,X5,X6,X7,X8,X9)
=> ! [X15] : X15 != vskolem1419(X14,X13,X5,X6,X7,X8,X9) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p','ass(cond(proof(404), 0), 0)') ).
fof('neg(neg(403))',conjecture,
~ ? [X1] :
( X1 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,X1)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& rS(vd1386,X1,vd1391)
& rpoint(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p','neg(neg(403))') ).
fof('qu(cond(axiom(97), 0), imp(cond(axiom(97), 0)))',axiom,
! [X132,X133,X134,X135] :
( ( rS(X132,X133,X134)
& X134 = X135
& rline(X135)
& ? [X136] :
( X133 = X136
& rpoint(X136) )
& ? [X137] :
( X132 = X137
& rpoint(X137) ) )
=> rS(X133,X132,X134) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p','qu(cond(axiom(97), 0), imp(cond(axiom(97), 0)))') ).
fof('and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))',axiom,
( vd1391 = vd1392
& ron(vd1385,vd1391)
& ron(vd1384,vd1391)
& rline(vd1392)
& vd1385 != vd1386
& vd1384 != vd1386
& vd1384 != vd1385
& ? [X2] :
( vd1386 = X2
& rpoint(X2) )
& ? [X3] :
( vd1385 = X3
& rpoint(X3) )
& ? [X4] :
( vd1384 = X4
& rpoint(X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p','and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))') ).
fof('qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))',axiom,
! [X126,X127,X128,X129] :
( ( rS(X126,X127,X128)
& X128 = X129
& rline(X129)
& ? [X130] :
( X127 = X130
& rpoint(X130) )
& ? [X131] :
( X126 = X131
& rpoint(X131) ) )
=> ~ ron(X126,X128) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p','qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))') ).
fof(c_0_5,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26] :
( X19 != X20
| ~ ron(X17,X19)
| ~ ron(X16,X19)
| ~ rline(X20)
| X17 = X18
| X16 = X18
| X16 = X17
| X18 != X21
| ~ rpoint(X21)
| X17 != X22
| ~ rpoint(X22)
| X16 != X23
| ~ rpoint(X23)
| X24 = X18
| vf(X17,X18) != vf(X17,X24)
| vf(X16,X18) != vf(X16,X24)
| ~ rS(X18,X24,X19)
| ~ rpoint(X24)
| X25 != vskolem1416(X24,X16,X17,X18,X19,X20)
| X26 != vskolem1419(X25,X24,X16,X17,X18,X19,X20) ),
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)],['ass(cond(proof(404), 0), 0)'])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ~ ? [X1] :
( X1 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,X1)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& rS(vd1386,X1,vd1391)
& rpoint(X1) ),
inference(assume_negation,[status(cth)],['neg(neg(403))']) ).
cnf(c_0_7,plain,
( X3 = X6
| X4 = X5
| X4 = X6
| X5 = X6
| X1 != vskolem1419(X2,X3,X4,X5,X6,X7,X8)
| X2 != vskolem1416(X3,X4,X5,X6,X7,X8)
| ~ rpoint(X3)
| ~ rS(X6,X3,X7)
| vf(X4,X6) != vf(X4,X3)
| vf(X5,X6) != vf(X5,X3)
| ~ rpoint(X9)
| X4 != X9
| ~ rpoint(X10)
| X5 != X10
| ~ rpoint(X11)
| X6 != X11
| ~ rline(X8)
| ~ ron(X4,X7)
| ~ ron(X5,X7)
| X7 != X8 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X138,X139,X140,X141,X142,X143] :
( ~ rS(X138,X139,X140)
| X140 != X141
| ~ rline(X141)
| X139 != X142
| ~ rpoint(X142)
| X138 != X143
| ~ rpoint(X143)
| rS(X139,X138,X140) ),
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)],['qu(cond(axiom(97), 0), imp(cond(axiom(97), 0)))'])])])])]) ).
fof(c_0_9,negated_conjecture,
( esk1_0 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,esk1_0)
& vf(vd1384,vd1386) = vf(vd1384,esk1_0)
& rS(vd1386,esk1_0,vd1391)
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
( vd1391 = vd1392
& ron(vd1385,vd1391)
& ron(vd1384,vd1391)
& rline(vd1392)
& vd1385 != vd1386
& vd1384 != vd1386
& vd1384 != vd1385
& vd1386 = esk2_0
& rpoint(esk2_0)
& vd1385 = esk3_0
& rpoint(esk3_0)
& vd1384 = esk4_0
& rpoint(esk4_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],['and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))'])])])]) ).
cnf(c_0_11,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X5 != vskolem1419(X6,X4,X3,X1,X2,X7,X7)
| X6 != vskolem1416(X4,X3,X1,X2,X7,X7)
| vf(X1,X4) != vf(X1,X2)
| vf(X3,X4) != vf(X3,X2)
| ~ rline(X7)
| ~ ron(X1,X7)
| ~ ron(X3,X7)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rS(X2,X4,X7) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( rS(X1,X2,X3)
| ~ rpoint(X4)
| X2 != X4
| ~ rpoint(X5)
| X1 != X5
| ~ rline(X6)
| X3 != X6
| ~ rS(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
rS(vd1386,esk1_0,vd1391),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
vd1386 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
vd1391 = vd1392,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X5 != vskolem1416(X4,X3,X1,X2,X6,X6)
| vf(X1,X4) != vf(X1,X2)
| vf(X3,X4) != vf(X3,X2)
| ~ rline(X6)
| ~ ron(X1,X6)
| ~ ron(X3,X6)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rS(X2,X4,X6) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( rS(X1,X2,X3)
| ~ rline(X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rS(X2,X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])])]) ).
cnf(c_0_18,negated_conjecture,
rS(esk2_0,esk1_0,vd1392),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
rline(vd1392),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 != vd1386,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
vf(vd1384,vd1386) = vf(vd1384,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
ron(vd1384,vd1391),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X132,X133,X134,X135,X136,X137] :
( ~ rS(X132,X133,X134)
| X134 != X135
| ~ rline(X135)
| X133 != X136
| ~ rpoint(X136)
| X132 != X137
| ~ rpoint(X137)
| ~ ron(X132,X134) ),
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)],[inference(fof_simplification,[status(thm)],['qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))'])])])])])]) ).
cnf(c_0_26,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| vf(X1,X4) != vf(X1,X2)
| vf(X3,X4) != vf(X3,X2)
| ~ rline(X5)
| ~ ron(X1,X5)
| ~ ron(X3,X5)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rS(X2,X4,X5) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
rS(esk1_0,esk2_0,vd1392),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 != esk2_0,
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_29,negated_conjecture,
vf(vd1384,esk1_0) = vf(vd1384,esk2_0),
inference(rw,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_30,plain,
vd1384 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
ron(vd1384,vd1392),
inference(rw,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
vf(vd1385,vd1386) = vf(vd1385,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,plain,
( ~ ron(X1,X2)
| ~ rpoint(X3)
| X1 != X3
| ~ rpoint(X4)
| X5 != X4
| ~ rline(X6)
| X2 != X6
| ~ rS(X1,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk1_0
| X2 = esk1_0
| X2 = X1
| vf(X1,esk1_0) != vf(X1,esk2_0)
| vf(X2,esk1_0) != vf(X2,esk2_0)
| ~ ron(X1,vd1392)
| ~ ron(X2,vd1392)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_20]),c_0_21])]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
vf(esk4_0,esk1_0) = vf(esk4_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_36,plain,
ron(esk4_0,vd1392),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_37,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
vf(vd1385,esk1_0) = vf(vd1385,esk2_0),
inference(rw,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_39,plain,
vd1385 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
ron(vd1385,vd1391),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,plain,
vd1384 != vd1385,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,plain,
( ~ rline(X1)
| ~ ron(X2,X1)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rS(X2,X3,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])])]) ).
cnf(c_0_43,negated_conjecture,
( esk1_0 = esk4_0
| X1 = esk1_0
| X1 = esk4_0
| vf(X1,esk1_0) != vf(X1,esk2_0)
| ~ ron(X1,vd1392)
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
vf(esk3_0,esk1_0) = vf(esk3_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]) ).
cnf(c_0_45,plain,
ron(esk3_0,vd1392),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_15]),c_0_39]) ).
cnf(c_0_46,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,plain,
esk4_0 != esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_39]),c_0_30]) ).
cnf(c_0_48,negated_conjecture,
~ ron(esk1_0,vd1392),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_19]),c_0_21]),c_0_20])]) ).
cnf(c_0_49,negated_conjecture,
( esk1_0 = esk4_0
| esk1_0 = esk3_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
esk1_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_50]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO340+1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 16:01:29 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.44/23.45 eprover: CPU time limit exceeded, terminating
% 0.44/23.46 eprover: CPU time limit exceeded, terminating
% 0.44/23.46 eprover: CPU time limit exceeded, terminating
% 0.44/23.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.61/46.48 eprover: CPU time limit exceeded, terminating
% 0.77/69.48 eprover: CPU time limit exceeded, terminating
% 0.77/69.49 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.77/69.49
% 0.77/69.49 eprover: CPU time limit exceeded, terminating
% 0.95/92.50 eprover: CPU time limit exceeded, terminating
% 0.95/92.51 eprover: CPU time limit exceeded, terminating
% 0.95/92.51 eprover: CPU time limit exceeded, terminating
% 0.95/92.51 eprover: CPU time limit exceeded, terminating
% 1.12/115.51 eprover: CPU time limit exceeded, terminating
% 1.12/115.52 eprover: CPU time limit exceeded, terminating
% 1.12/115.52 eprover: CPU time limit exceeded, terminating
% 1.12/115.53 eprover: CPU time limit exceeded, terminating
% 1.12/116.29 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 1.12/116.29
% 1.12/116.29 # Failure: Resource limit exceeded (time)
% 1.12/116.29 # OLD status Res
% 1.12/116.29 # Preprocessing time : 0.083 s
% 1.12/116.29 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 1.12/116.29
% 1.12/116.29 # Failure: Resource limit exceeded (time)
% 1.12/116.29 # OLD status Res
% 1.12/116.29 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.12/116.29 # Preprocessing time : 0.019 s
% 1.12/116.29 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 1.12/116.29
% 1.12/116.29 # Failure: Resource limit exceeded (time)
% 1.12/116.29 # OLD status Res
% 1.12/116.29 # Preprocessing time : 0.035 s
% 1.12/116.29 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 1.12/116.29
% 1.12/116.29 # Failure: Resource limit exceeded (time)
% 1.12/116.29 # OLD status Res
% 1.12/116.29 # Preprocessing time : 0.038 s
% 1.12/116.29 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 1.12/116.29
% 1.12/116.29 # Failure: Resource limit exceeded (time)
% 1.12/116.29 # OLD status Res
% 1.12/116.29 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 1.13/116.29 # Preprocessing time : 0.021 s
% 1.13/116.29 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 1.13/116.29 # Preprocessing time : 0.067 s
% 1.13/116.29
% 1.13/116.29 # Proof found!
% 1.13/116.29 # SZS status Theorem
% 1.13/116.29 # SZS output start CNFRefutation
% See solution above
% 1.13/116.29 # Proof object total steps : 52
% 1.13/116.29 # Proof object clause steps : 41
% 1.13/116.29 # Proof object formula steps : 11
% 1.13/116.29 # Proof object conjectures : 21
% 1.13/116.29 # Proof object clause conjectures : 18
% 1.13/116.29 # Proof object formula conjectures : 3
% 1.13/116.29 # Proof object initial clauses used : 19
% 1.13/116.29 # Proof object initial formulas used : 5
% 1.13/116.29 # Proof object generating inferences : 8
% 1.13/116.29 # Proof object simplifying inferences : 50
% 1.13/116.29 # Training examples: 0 positive, 0 negative
% 1.13/116.29 # Parsed axioms : 124
% 1.13/116.29 # Removed by relevancy pruning/SinE : 0
% 1.13/116.29 # Initial clauses : 299
% 1.13/116.29 # Removed in clause preprocessing : 2
% 1.13/116.29 # Initial clauses in saturation : 297
% 1.13/116.29 # Processed clauses : 3281
% 1.13/116.29 # ...of these trivial : 8
% 1.13/116.29 # ...subsumed : 1598
% 1.13/116.29 # ...remaining for further processing : 1675
% 1.13/116.29 # Other redundant clauses eliminated : 1237
% 1.13/116.29 # Clauses deleted for lack of memory : 0
% 1.13/116.29 # Backward-subsumed : 48
% 1.13/116.29 # Backward-rewritten : 819
% 1.13/116.29 # Generated clauses : 34906
% 1.13/116.29 # ...of the previous two non-trivial : 35474
% 1.13/116.29 # Contextual simplify-reflections : 0
% 1.13/116.29 # Paramodulations : 34621
% 1.13/116.29 # Factorizations : 1
% 1.13/116.29 # Equation resolutions : 1256
% 1.13/116.29 # Current number of processed clauses : 543
% 1.13/116.29 # Positive orientable unit clauses : 25
% 1.13/116.29 # Positive unorientable unit clauses: 0
% 1.13/116.29 # Negative unit clauses : 7
% 1.13/116.29 # Non-unit-clauses : 511
% 1.13/116.29 # Current number of unprocessed clauses: 9128
% 1.13/116.29 # ...number of literals in the above : 94677
% 1.13/116.29 # Current number of archived formulas : 0
% 1.13/116.29 # Current number of archived clauses : 867
% 1.13/116.29 # Clause-clause subsumption calls (NU) : 185053
% 1.13/116.29 # Rec. Clause-clause subsumption calls : 8804
% 1.13/116.29 # Non-unit clause-clause subsumptions : 1640
% 1.13/116.29 # Unit Clause-clause subsumption calls : 465
% 1.13/116.29 # Rewrite failures with RHS unbound : 0
% 1.13/116.29 # BW rewrite match attempts : 7
% 1.13/116.29 # BW rewrite match successes : 7
% 1.13/116.29 # Condensation attempts : 0
% 1.13/116.29 # Condensation successes : 0
% 1.13/116.29 # Termbank termtop insertions : 1192432
% 1.13/116.29
% 1.13/116.29 # -------------------------------------------------
% 1.13/116.29 # User time : 0.690 s
% 1.13/116.29 # System time : 0.021 s
% 1.13/116.29 # Total time : 0.711 s
% 1.13/116.29 # Maximum resident set size: 45112 pages
% 1.13/138.53 eprover: CPU time limit exceeded, terminating
% 1.13/138.54 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.13/138.54
% 1.13/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.54 eprover: No such file or directory
% 1.13/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.55 eprover: No such file or directory
% 1.13/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.55 eprover: No such file or directory
% 1.13/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.55 eprover: No such file or directory
% 1.13/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.55 eprover: No such file or directory
% 1.13/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.55 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.56 eprover: No such file or directory
% 1.13/138.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.57 eprover: No such file or directory
% 1.13/138.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.57 eprover: No such file or directory
% 1.13/138.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.13/138.57 eprover: No such file or directory
% 1.13/138.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.58 eprover: No such file or directory
% 1.13/138.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.13/138.58 eprover: No such file or directory
%------------------------------------------------------------------------------