TSTP Solution File: GEO291+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO291+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:19 EDT 2022
% Result : Theorem 0.83s 120.00s
% Output : CNFRefutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 67 ( 50 unt; 0 def)
% Number of atoms : 244 ( 65 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 290 ( 113 ~; 111 |; 65 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 19 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 22 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(115), 0), imp(cond(axiom(115), 0)))',axiom,
! [X289,X290,X291,X292,X293,X294,X295] :
( ( X293 != X292
& ~ ron(X295,X290)
& ~ rS(X293,X295,X290)
& rS(X294,X295,X289)
& ron(X295,X291)
& ron(X294,X290)
& ron(X293,X289)
& ron(X292,X291)
& ron(X292,X290)
& ron(X292,X289)
& ? [X296] :
( X295 = X296
& rpoint(X296) )
& ? [X297] :
( X294 = X297
& rpoint(X297) )
& ? [X298] :
( X293 = X298
& rpoint(X298) )
& ? [X299] :
( X292 = X299
& rpoint(X299) )
& ? [X300] :
( X291 = X300
& rline(X300) )
& ? [X301] :
( X290 = X301
& rline(X301) )
& ? [X302] :
( X289 = X302
& rline(X302) ) )
=> rS(X293,X294,X291) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(axiom(115), 0), imp(cond(axiom(115), 0)))') ).
fof('qe(s3(plural(271)))',axiom,
? [X1] :
( vd1201 = X1
& rpoint(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s3(plural(271)))') ).
fof('and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))',axiom,
( ~ ? [X2] :
( ron(vd1187,X2)
& ron(vd1186,X2)
& ron(vd1185,X2)
& rline(X2) )
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& ? [X3] :
( vd1187 = X3
& rpoint(X3) )
& ? [X4] :
( vd1186 = X4
& rpoint(X4) )
& ? [X5] :
( vd1185 = X5
& rpoint(X5) )
& vd1179 != vd1180
& vd1178 != vd1180
& vd1178 != vd1179
& ? [X6] :
( vd1180 = X6
& rpoint(X6) )
& ? [X7] :
( vd1179 = X7
& rpoint(X7) )
& ? [X8] :
( vd1178 = X8
& rpoint(X8) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).
fof('holds(291, 1230, 0)',axiom,
vd1199 = vd1185,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(291, 1230, 0)') ).
fof('holds(295, 1236, 0)',axiom,
rS(vd1187,vd1201,vd1197),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(295, 1236, 0)') ).
fof('pred(269, 0)',axiom,
rline(vd1197),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(269, 0)') ).
fof('pred(s3(plural(274)), 0)',axiom,
ron(vd1185,vd1197),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s3(plural(274)), 0)') ).
fof('dis(case_distinction(conseq(296)))',conjecture,
( rS(vd1200,vd1187,vd1234)
| rS(vd1186,vd1201,vd1232) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','dis(case_distinction(conseq(296)))') ).
fof('pred(s1(plural(293)), 0)',axiom,
ron(vd1185,vd1232),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s1(plural(293)), 0)') ).
fof('neg(neg(296))',axiom,
~ ron(vd1201,vd1232),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','neg(neg(296))') ).
fof('pred(s2(plural(293)), 0)',axiom,
ron(vd1187,vd1232),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s2(plural(293)), 0)') ).
fof('pred(293, 0)',axiom,
rline(vd1232),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(293, 0)') ).
fof('pred(s1(plural(294)), 0)',axiom,
ron(vd1185,vd1234),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s1(plural(294)), 0)') ).
fof('holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)',axiom,
vd1200 = vd1186,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)') ).
fof('pred(s2(plural(294)), 0)',axiom,
ron(vd1201,vd1234),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s2(plural(294)), 0)') ).
fof('pred(294, 0)',axiom,
rline(vd1234),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(294, 0)') ).
fof('pred(s2(plural(274)), 0)',axiom,
ron(vd1200,vd1197),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s2(plural(274)), 0)') ).
fof(c_0_17,plain,
! [X303,X304,X305,X306,X307,X308,X309,X310,X311,X312,X313,X314,X315,X316] :
( X307 = X306
| ron(X309,X304)
| rS(X307,X309,X304)
| ~ rS(X308,X309,X303)
| ~ ron(X309,X305)
| ~ ron(X308,X304)
| ~ ron(X307,X303)
| ~ ron(X306,X305)
| ~ ron(X306,X304)
| ~ ron(X306,X303)
| X309 != X310
| ~ rpoint(X310)
| X308 != X311
| ~ rpoint(X311)
| X307 != X312
| ~ rpoint(X312)
| X306 != X313
| ~ rpoint(X313)
| X305 != X314
| ~ rline(X314)
| X304 != X315
| ~ rline(X315)
| X303 != X316
| ~ rline(X316)
| rS(X307,X308,X305) ),
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(115), 0), imp(cond(axiom(115), 0)))'])])])])])]) ).
fof(c_0_18,plain,
( vd1201 = esk5_0
& rpoint(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).
fof(c_0_19,plain,
! [X9] :
( ( ~ ron(vd1187,X9)
| ~ ron(vd1186,X9)
| ~ ron(vd1185,X9)
| ~ rline(X9) )
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vd1187 = esk6_0
& rpoint(esk6_0)
& vd1186 = esk7_0
& rpoint(esk7_0)
& vd1185 = esk8_0
& rpoint(esk8_0)
& vd1179 != vd1180
& vd1178 != vd1180
& vd1178 != vd1179
& vd1180 = esk9_0
& rpoint(esk9_0)
& vd1179 = esk10_0
& rpoint(esk10_0)
& vd1178 = esk11_0
& rpoint(esk11_0) ),
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)],['and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))'])])])])])]) ).
cnf(c_0_20,plain,
( rS(X1,X2,X3)
| rS(X1,X14,X7)
| ron(X14,X7)
| X1 = X10
| ~ rline(X4)
| X5 != X4
| ~ rline(X6)
| X7 != X6
| ~ rline(X8)
| X3 != X8
| ~ rpoint(X9)
| X10 != X9
| ~ rpoint(X11)
| X1 != X11
| ~ rpoint(X12)
| X2 != X12
| ~ rpoint(X13)
| X14 != X13
| ~ ron(X10,X5)
| ~ ron(X10,X7)
| ~ ron(X10,X3)
| ~ ron(X1,X5)
| ~ ron(X2,X7)
| ~ ron(X14,X3)
| ~ rS(X2,X14,X5) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
rpoint(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
vd1201 = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
rpoint(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
vd1187 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
vd1185 = esk8_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
vd1199 = vd1185,
inference(split_conjunct,[status(thm)],['holds(291, 1230, 0)']) ).
cnf(c_0_27,plain,
( X1 = X2
| ron(X3,X4)
| rS(X1,X3,X4)
| rS(X1,X5,X6)
| ~ rpoint(X3)
| ~ rpoint(X5)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rline(X6)
| ~ rline(X4)
| ~ rline(X7)
| ~ ron(X3,X6)
| ~ ron(X2,X4)
| ~ ron(X2,X7)
| ~ ron(X2,X6)
| ~ ron(X5,X4)
| ~ ron(X1,X7)
| ~ rS(X5,X3,X7) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])])])])])])]) ).
cnf(c_0_28,plain,
rS(vd1187,vd1201,vd1197),
inference(split_conjunct,[status(thm)],['holds(295, 1236, 0)']) ).
cnf(c_0_29,plain,
rpoint(vd1201),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
rpoint(vd1187),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
rline(vd1197),
inference(split_conjunct,[status(thm)],['pred(269, 0)']) ).
cnf(c_0_32,plain,
ron(vd1185,vd1197),
inference(split_conjunct,[status(thm)],['pred(s3(plural(274)), 0)']) ).
cnf(c_0_33,plain,
rpoint(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
esk8_0 = vd1199,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_35,negated_conjecture,
~ ( rS(vd1200,vd1187,vd1234)
| rS(vd1186,vd1201,vd1232) ),
inference(assume_negation,[status(cth)],['dis(case_distinction(conseq(296)))']) ).
cnf(c_0_36,plain,
( X1 = X2
| ron(vd1201,X3)
| rS(X1,vd1201,X3)
| rS(X1,vd1187,X4)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rline(X4)
| ~ rline(X3)
| ~ ron(vd1201,X4)
| ~ ron(X2,vd1197)
| ~ ron(vd1187,X3)
| ~ ron(X1,vd1197)
| ~ ron(X2,X3)
| ~ ron(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_37,plain,
ron(vd1199,vd1197),
inference(rw,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_38,plain,
rpoint(vd1199),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
ron(vd1185,vd1232),
inference(split_conjunct,[status(thm)],['pred(s1(plural(293)), 0)']) ).
fof(c_0_40,plain,
~ ron(vd1201,vd1232),
inference(fof_simplification,[status(thm)],['neg(neg(296))']) ).
fof(c_0_41,negated_conjecture,
( ~ rS(vd1200,vd1187,vd1234)
& ~ rS(vd1186,vd1201,vd1232) ),
inference(fof_nnf,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( X1 = vd1199
| ron(vd1201,X2)
| rS(X1,vd1201,X2)
| rS(X1,vd1187,X3)
| ~ rpoint(X1)
| ~ rline(X3)
| ~ rline(X2)
| ~ ron(vd1201,X3)
| ~ ron(vd1187,X2)
| ~ ron(X1,vd1197)
| ~ ron(vd1199,X2)
| ~ ron(vd1199,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
ron(vd1187,vd1232),
inference(split_conjunct,[status(thm)],['pred(s2(plural(293)), 0)']) ).
cnf(c_0_44,plain,
rline(vd1232),
inference(split_conjunct,[status(thm)],['pred(293, 0)']) ).
cnf(c_0_45,plain,
ron(vd1199,vd1232),
inference(rw,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_46,plain,
~ ron(vd1201,vd1232),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
ron(vd1185,vd1234),
inference(split_conjunct,[status(thm)],['pred(s1(plural(294)), 0)']) ).
cnf(c_0_48,plain,
( ~ rline(X1)
| ~ ron(vd1185,X1)
| ~ ron(vd1186,X1)
| ~ ron(vd1187,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,negated_conjecture,
~ rS(vd1200,vd1187,vd1234),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
vd1200 = vd1186,
inference(split_conjunct,[status(thm)],['holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)']) ).
cnf(c_0_51,plain,
( X1 = vd1199
| rS(X1,vd1201,vd1232)
| rS(X1,vd1187,X2)
| ~ rpoint(X1)
| ~ rline(X2)
| ~ ron(vd1201,X2)
| ~ ron(X1,vd1197)
| ~ ron(vd1199,X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]),c_0_46]) ).
cnf(c_0_52,plain,
ron(vd1201,vd1234),
inference(split_conjunct,[status(thm)],['pred(s2(plural(294)), 0)']) ).
cnf(c_0_53,plain,
rline(vd1234),
inference(split_conjunct,[status(thm)],['pred(294, 0)']) ).
cnf(c_0_54,plain,
ron(vd1199,vd1234),
inference(rw,[status(thm)],[c_0_47,c_0_26]) ).
cnf(c_0_55,plain,
rpoint(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_56,plain,
vd1186 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_57,plain,
ron(vd1200,vd1197),
inference(split_conjunct,[status(thm)],['pred(s2(plural(274)), 0)']) ).
cnf(c_0_58,plain,
( ~ rline(X1)
| ~ ron(vd1187,X1)
| ~ ron(vd1186,X1)
| ~ ron(vd1199,X1) ),
inference(rw,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_59,negated_conjecture,
~ rS(vd1186,vd1187,vd1234),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
( X1 = vd1199
| rS(X1,vd1201,vd1232)
| rS(X1,vd1187,vd1234)
| ~ rpoint(X1)
| ~ ron(X1,vd1197) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54])]) ).
cnf(c_0_61,plain,
rpoint(vd1186),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
ron(vd1186,vd1197),
inference(rw,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_63,negated_conjecture,
~ rS(vd1186,vd1201,vd1232),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_64,plain,
~ ron(vd1186,vd1232),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_65,negated_conjecture,
vd1186 = vd1199,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62])]),c_0_63]) ).
cnf(c_0_66,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO291+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 20:46:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.37/23.43
% 0.48/46.43 eprover: CPU time limit exceeded, terminating
% 0.48/46.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.45 eprover: CPU time limit exceeded, terminating
% 0.60/69.45 eprover: CPU time limit exceeded, terminating
% 0.60/69.46 eprover: CPU time limit exceeded, terminating
% 0.60/69.47 eprover: CPU time limit exceeded, terminating
% 0.60/69.48 eprover: CPU time limit exceeded, terminating
% 0.71/92.46 eprover: CPU time limit exceeded, terminating
% 0.71/92.47 eprover: CPU time limit exceeded, terminating
% 0.71/92.48 eprover: CPU time limit exceeded, terminating
% 0.71/92.50 eprover: CPU time limit exceeded, terminating
% 0.81/115.46 eprover: CPU time limit exceeded, terminating
% 0.81/115.48 eprover: CPU time limit exceeded, terminating
% 0.81/115.49 eprover: CPU time limit exceeded, terminating
% 0.81/115.51 eprover: CPU time limit exceeded, terminating
% 0.83/120.00 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.83/120.00
% 0.83/120.00 # Failure: Resource limit exceeded (time)
% 0.83/120.00 # OLD status Res
% 0.83/120.00 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.83/120.00 # Preprocessing time : 0.052 s
% 0.83/120.00 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.83/120.00
% 0.83/120.00 # Failure: Resource limit exceeded (time)
% 0.83/120.00 # OLD status Res
% 0.83/120.00 # Preprocessing time : 0.065 s
% 0.83/120.00 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.83/120.00
% 0.83/120.00 # Failure: Resource limit exceeded (time)
% 0.83/120.00 # OLD status Res
% 0.83/120.00 # Preprocessing time : 0.060 s
% 0.83/120.00 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 0.83/120.00
% 0.83/120.00 # Failure: Resource limit exceeded (time)
% 0.83/120.00 # OLD status Res
% 0.83/120.00 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 0.83/120.00 # Preprocessing time : 0.048 s
% 0.83/120.00 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 0.83/120.00
% 0.83/120.00 # Failure: Resource limit exceeded (time)
% 0.83/120.00 # OLD status Res
% 0.83/120.00 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 0.83/120.00 # Preprocessing time : 0.026 s
% 0.83/120.00 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 0.83/120.00 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 0.83/120.00 # Preprocessing time : 0.026 s
% 0.83/120.00
% 0.83/120.00 # Proof found!
% 0.83/120.00 # SZS status Theorem
% 0.83/120.00 # SZS output start CNFRefutation
% See solution above
% 0.83/120.00 # Proof object total steps : 67
% 0.83/120.00 # Proof object clause steps : 44
% 0.83/120.00 # Proof object formula steps : 23
% 0.83/120.00 # Proof object conjectures : 7
% 0.83/120.00 # Proof object clause conjectures : 4
% 0.83/120.00 # Proof object formula conjectures : 3
% 0.83/120.00 # Proof object initial clauses used : 25
% 0.83/120.00 # Proof object initial formulas used : 17
% 0.83/120.00 # Proof object generating inferences : 6
% 0.83/120.00 # Proof object simplifying inferences : 41
% 0.83/120.00 # Training examples: 0 positive, 0 negative
% 0.83/120.00 # Parsed axioms : 150
% 0.83/120.00 # Removed by relevancy pruning/SinE : 61
% 0.83/120.00 # Initial clauses : 184
% 0.83/120.00 # Removed in clause preprocessing : 2
% 0.83/120.00 # Initial clauses in saturation : 182
% 0.83/120.00 # Processed clauses : 3403
% 0.83/120.00 # ...of these trivial : 17
% 0.83/120.00 # ...subsumed : 1088
% 0.83/120.00 # ...remaining for further processing : 2298
% 0.83/120.00 # Other redundant clauses eliminated : 764
% 0.83/120.00 # Clauses deleted for lack of memory : 0
% 0.83/120.00 # Backward-subsumed : 43
% 0.83/120.00 # Backward-rewritten : 411
% 0.83/120.00 # Generated clauses : 47023
% 0.83/120.00 # ...of the previous two non-trivial : 45380
% 0.83/120.00 # Contextual simplify-reflections : 0
% 0.83/120.00 # Paramodulations : 46896
% 0.83/120.00 # Factorizations : 2
% 0.83/120.00 # Equation resolutions : 769
% 0.83/120.00 # Current number of processed clauses : 1724
% 0.83/120.00 # Positive orientable unit clauses : 29
% 0.83/120.00 # Positive unorientable unit clauses: 0
% 0.83/120.00 # Negative unit clauses : 6
% 0.83/120.00 # Non-unit-clauses : 1689
% 0.83/120.00 # Current number of unprocessed clauses: 29747
% 0.83/120.00 # ...number of literals in the above : 728291
% 0.83/120.00 # Current number of archived formulas : 0
% 0.83/120.00 # Current number of archived clauses : 454
% 0.83/120.00 # Clause-clause subsumption calls (NU) : 181680
% 0.83/120.00 # Rec. Clause-clause subsumption calls : 7626
% 0.83/120.00 # Non-unit clause-clause subsumptions : 1071
% 0.83/120.00 # Unit Clause-clause subsumption calls : 470
% 0.83/120.00 # Rewrite failures with RHS unbound : 0
% 0.83/120.00 # BW rewrite match attempts : 2
% 0.83/120.00 # BW rewrite match successes : 2
% 0.83/120.00 # Condensation attempts : 0
% 0.83/120.00 # Condensation successes : 0
% 0.83/120.00 # Termbank termtop insertions : 2759315
% 0.83/120.00
% 0.83/120.00 # -------------------------------------------------
% 0.83/120.00 # User time : 4.184 s
% 0.83/120.00 # System time : 0.056 s
% 0.83/120.00 # Total time : 4.240 s
% 0.83/120.00 # Maximum resident set size: 81404 pages
%------------------------------------------------------------------------------