%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO280+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:30:00 PM UTC 2026
% Result : Theorem 0.61s 0.74s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 28 unt; 0 def)
% Number of atoms : 215 ( 70 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 264 ( 108 ~; 92 |; 57 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 40 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof('and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))',axiom,
( rpoint(vd1124)
& vd1123 = vd1124
& rpoint(vd1126)
& vd1125 = vd1126
& rpoint(vd1128)
& vd1127 = vd1128
& rpoint(vd1130)
& vd1129 = vd1130
& vd1123 != vd1125
& vd1127 != vd1129
& rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))') ).
fof('qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))',axiom,
! [X82,X83] :
( ( ? [X85] :
( rpoint(X85)
& X82 = X85 )
& ? [X84] :
( rpoint(X84)
& X83 = X84 ) )
=> ? [X86] :
( rreal(X86)
& vf(X82,X83) = X86 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X651,X652] :
( ( ? [X654] :
( rpoint(X654)
& X651 = X654 )
& ? [X653] :
( rpoint(X653)
& X652 = X653 ) )
=> vf(X651,X652) = vf(X652,X651) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))',axiom,
! [X157,X158] :
( ( rreal(X158)
& X157 = X158 )
=> ~ rless(X157,X157) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))') ).
fof('qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))',axiom,
! [X151,X152,X153,X154,X155,X156] :
( ( rreal(X152)
& X151 = X152
& rreal(X154)
& X153 = X154
& rreal(X156)
& X155 = X156
& rless(X151,X153)
& rless(X153,X155) )
=> rless(X151,X155) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))') ).
fof('holds(245, 1137, 0)',axiom,
vf(vd1127,vd1129) = vf(vd1123,vd1136),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(245, 1137, 0)') ).
fof('qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))',axiom,
! [X139,X140,X141,X142] :
( ( ? [X144] :
( rpoint(X144)
& X139 = X144 )
& ? [X143] :
( rpoint(X143)
& X140 = X143 )
& rcenter(X141,X142)
& ron(X140,X142) )
=> ( rless(vf(X141,X139),vf(X141,X140))
<=> rinside(X139,X142) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))') ).
fof('neg(neg(247))',conjecture,
~ rinside(vd1125,vd1139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','neg(neg(247))') ).
fof('and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct2(comma_conjunct2(246)), 0), pred(comma_conjunct1(comma_conjunct2(246)), 0)))), pred(comma_conjunct1(246), 0))',axiom,
( ron(vd1123,vd1138)
& ron(vd1125,vd1138)
& rcircle(vd1139)
& rcenter(vd1123,vd1139)
& ron(vd1136,vd1139) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct2(comma_conjunct2(246)), 0), pred(comma_conjunct1(comma_conjunct2(246)), 0)))), pred(comma_conjunct1(246), 0))') ).
fof('pred(245, 0)',axiom,
rpoint(vd1136),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(245, 0)') ).
fof(c_0_10,plain,
( rpoint(vd1124)
& vd1123 = vd1124
& rpoint(vd1126)
& vd1125 = vd1126
& rpoint(vd1128)
& vd1127 = vd1128
& rpoint(vd1130)
& vd1129 = vd1130
& vd1123 != vd1125
& vd1127 != vd1129
& rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
inference(fof_simplification,[status(thm)],['and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))']) ).
fof(c_0_11,plain,
! [X832,X833,X834,X835] :
( ( ~ rpoint(X835)
| X832 != X835
| ~ rpoint(X834)
| X833 != X834
| rreal(esk6_2(X832,X833)) )
& ( ~ rpoint(X835)
| X832 != X835
| ~ rpoint(X834)
| X833 != X834
| vf(X832,X833) = esk6_2(X832,X833) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))'])])])])])]) ).
fof(c_0_12,plain,
! [X1401,X1402,X1403,X1404] :
( vf(X1401,X1402) = vf(X1402,X1401)
| ~ rpoint(X1404)
| X1401 != X1404
| ~ rpoint(X1403)
| X1402 != X1403 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])])]) ).
fof(c_0_13,plain,
( rpoint(vd1124)
& vd1123 = vd1124
& rpoint(vd1126)
& vd1125 = vd1126
& rpoint(vd1128)
& vd1127 = vd1128
& rpoint(vd1130)
& vd1129 = vd1130
& vd1123 != vd1125
& vd1127 != vd1129
& rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| rreal(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) = esk6_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
rpoint(vd1128),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
vd1127 = vd1128,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
rpoint(vd1130),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
vd1129 = vd1130,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X157,X158] :
( ( rreal(X158)
& X157 = X158 )
=> ~ rless(X157,X157) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))']) ).
fof(c_0_22,plain,
! [X901,X902,X903,X904,X905,X906] :
( rless(X901,X905)
| ~ rreal(X902)
| X901 != X902
| ~ rreal(X904)
| X903 != X904
| ~ rreal(X906)
| X905 != X906
| ~ rless(X901,X903)
| ~ rless(X903,X905) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))'])])]) ).
cnf(c_0_23,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(esk6_2(X1,X2)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_24,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| esk6_2(X1,X2) = vf(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])]) ).
cnf(c_0_25,plain,
vf(vd1127,vd1129) = vf(vd1123,vd1136),
inference(split_conjunct,[status(thm)],['holds(245, 1137, 0)']) ).
cnf(c_0_26,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| vf(X1,X2) = vf(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_27,plain,
rpoint(vd1127),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
rpoint(vd1129),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_29,plain,
! [X907,X908] :
( ~ rless(X907,X907)
| ~ rreal(X908)
| X907 != X908 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_30,plain,
( ~ rreal(X6)
| X3 != X6
| ~ rreal(X5)
| X1 != X5
| ~ rreal(X4)
| X2 != X4
| ~ rless(X3,X1)
| ~ rless(X1,X2)
| rless(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
rless(vf(vd1127,vd1129),vf(vd1123,vd1125)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(vf(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
vf(vd1129,vd1127) = vf(vd1123,vd1136),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
fof(c_0_34,plain,
! [X889,X890,X891,X892,X893,X894] :
( ( ~ rpoint(X894)
| X889 != X894
| ~ rpoint(X893)
| X890 != X893
| ~ rcenter(X891,X892)
| ~ ron(X890,X892)
| rless(vf(X891,X889),vf(X891,X890))
| ~ rinside(X889,X892) )
& ( ~ rpoint(X894)
| X889 != X894
| ~ rpoint(X893)
| X890 != X893
| ~ rcenter(X891,X892)
| ~ ron(X890,X892)
| rinside(X889,X892)
| ~ rless(vf(X891,X889),vf(X891,X890)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))'])])])])]) ).
cnf(c_0_35,plain,
( ~ rless(X1,X1)
| ~ rreal(X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( ~ rless(X3,X2)
| ~ rless(X1,X3)
| ~ rreal(X2)
| ~ rreal(X3)
| ~ rreal(X1)
| rless(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])])]) ).
cnf(c_0_37,plain,
rless(vf(vd1123,vd1136),vf(vd1123,vd1125)),
inference(rw,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_38,plain,
rreal(vf(vd1123,vd1136)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]),c_0_27])]) ).
cnf(c_0_39,plain,
( ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X4 != X5
| ~ rcenter(X3,X2)
| ~ ron(X4,X2)
| ~ rinside(X1,X2)
| rless(vf(X3,X1),vf(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,negated_conjecture,
~ ~ rinside(vd1125,vd1139),
inference(assume_negation,[status(cth)],['neg(neg(247))']) ).
cnf(c_0_41,plain,
( ~ rless(X1,X1)
| ~ rreal(X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( ~ rless(vf(vd1123,vd1125),X1)
| ~ rreal(X1)
| ~ rreal(vf(vd1123,vd1125))
| rless(vf(vd1123,vd1136),X1) ),
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,
( ~ rinside(X2,X4)
| ~ ron(X3,X4)
| ~ rcenter(X1,X4)
| ~ rpoint(X3)
| ~ rpoint(X2)
| rless(vf(X1,X2),vf(X1,X3)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_39])]) ).
cnf(c_0_44,plain,
rcenter(vd1123,vd1139),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct2(comma_conjunct2(246)), 0), pred(comma_conjunct1(comma_conjunct2(246)), 0)))), pred(comma_conjunct1(246), 0))']) ).
cnf(c_0_45,plain,
rpoint(vd1126),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,plain,
vd1125 = vd1126,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_47,negated_conjecture,
rinside(vd1125,vd1139),
inference(fof_simplification,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( ~ rless(vf(vd1123,vd1125),vf(vd1123,vd1136))
| ~ rreal(vf(vd1123,vd1125)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38])]) ).
cnf(c_0_49,plain,
( ~ rinside(X1,vd1139)
| ~ ron(X2,vd1139)
| ~ rpoint(X2)
| ~ rpoint(X1)
| rless(vf(vd1123,X1),vf(vd1123,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
rpoint(vd1125),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
rpoint(vd1136),
inference(split_conjunct,[status(thm)],['pred(245, 0)']) ).
cnf(c_0_52,plain,
ron(vd1136,vd1139),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(246))), 0), and(pred(comma_conjunct2(comma_conjunct2(246)), 0), pred(comma_conjunct1(comma_conjunct2(246)), 0)))), pred(comma_conjunct1(246), 0))']) ).
cnf(c_0_53,negated_conjecture,
rinside(vd1125,vd1139),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
rpoint(vd1124),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,plain,
vd1123 = vd1124,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_56,plain,
~ rreal(vf(vd1123,vd1125)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_57,plain,
rpoint(vd1123),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_32]),c_0_57]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO280+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 15:06:51 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.74 % Version: 3.5.1
% 0.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.74 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.74 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.74 % Starting sh5l with 300s (1) cores
% 0.61/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2935155 completed with status 0
% 0.61/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.74 % No SInE strategy applied
% 0.61/0.74 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.61/0.74 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.74 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.61/0.74 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.61/0.74 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.61/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.61/0.74 % SubtermCWHack with pid 2935161 completed with status 0
% 0.61/0.74 % Result found by SubtermCWHack
% 0.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.74 % No SInE strategy applied
% 0.61/0.74 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.61/0.74 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.74 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.74 % Preprocessing time : 0.010 s
% 0.61/0.74
% 0.61/0.74 % Proof found!
% 0.61/0.74 % SZS status Theorem
% 0.61/0.74 % SZS output start CNFRefutation
% See solution above
% 0.61/0.74 % Parsed axioms : 115
% 0.61/0.74 % Removed by relevancy pruning/SinE : 0
% 0.61/0.74 % Initial clauses : 275
% 0.61/0.74 % Removed in clause preprocessing : 2
% 0.61/0.74 % Initial clauses in saturation : 273
% 0.61/0.74 % Processed clauses : 1027
% 0.61/0.74 % ...of these trivial : 5
% 0.61/0.74 % ...subsumed : 589
% 0.61/0.74 % ...remaining for further processing : 433
% 0.61/0.74 % Other redundant clauses eliminated : 429
% 0.61/0.74 % Clauses deleted for lack of memory : 0
% 0.61/0.74 % Backward-subsumed : 10
% 0.61/0.74 % Backward-rewritten : 8
% 0.61/0.74 % Generated clauses : 1448
% 0.61/0.74 % ...of the previous two non-redundant : 1314
% 0.61/0.74 % ...aggressively subsumed : 0
% 0.61/0.74 % Contextual simplify-reflections : 10
% 0.61/0.74 % Paramodulations : 1280
% 0.61/0.74 % Factorizations : 0
% 0.61/0.74 % NegExts : 0
% 0.61/0.74 % Equation resolutions : 436
% 0.61/0.74 % Disequality decompositions : 0
% 0.61/0.74 % Total rewrite steps : 1063
% 0.61/0.74 % ...of those cached : 1040
% 0.61/0.74 % Propositional unsat checks : 0
% 0.61/0.74 % Propositional check models : 0
% 0.61/0.74 % Propositional check unsatisfiable : 0
% 0.61/0.74 % Propositional clauses : 0
% 0.61/0.74 % Propositional clauses after purity: 0
% 0.61/0.74 % Propositional unsat core size : 0
% 0.61/0.74 % Propositional preprocessing time : 0.000
% 0.61/0.74 % Propositional encoding time : 0.000
% 0.61/0.74 % Propositional solver time : 0.000
% 0.61/0.74 % Success case prop preproc time : 0.000
% 0.61/0.74 % Success case prop encoding time : 0.000
% 0.61/0.74 % Success case prop solver time : 0.000
% 0.61/0.74 % Current number of processed clauses : 260
% 0.61/0.74 % Positive orientable unit clauses : 28
% 0.61/0.74 % Positive unorientable unit clauses: 0
% 0.61/0.74 % Negative unit clauses : 12
% 0.61/0.74 % Non-unit-clauses : 220
% 0.61/0.74 % Current number of unprocessed clauses: 487
% 0.61/0.74 % ...number of literals in the above : 4582
% 0.61/0.74 % Current number of archived formulas : 0
% 0.61/0.74 % Current number of archived clauses : 18
% 0.61/0.74 % Clause-clause subsumption calls (NU) : 51536
% 0.61/0.74 % Rec. Clause-clause subsumption calls : 4541
% 0.61/0.74 % Non-unit clause-clause subsumptions : 441
% 0.61/0.74 % Unit Clause-clause subsumption calls : 372
% 0.61/0.74 % Rewrite failures with RHS unbound : 0
% 0.61/0.74 % BW rewrite match attempts : 8
% 0.61/0.74 % BW rewrite match successes : 8
% 0.61/0.74 % Condensation attempts : 0
% 0.61/0.74 % Condensation successes : 0
% 0.61/0.74 % Termbank termtop insertions : 70564
% 0.61/0.74 % Search garbage collected termcells : 13986
% 0.61/0.74
% 0.61/0.74 % -------------------------------------------------
% 0.61/0.74 % User time : 0.162 s
% 0.61/0.74 % System time : 0.012 s
% 0.61/0.74 % Total time : 0.174 s
% 0.61/0.74 % Maximum resident set size: 6004 pages
% 0.61/0.74
% 0.61/0.74 % -------------------------------------------------
% 0.61/0.74 % User time : 0.626 s
% 0.61/0.74 % System time : 0.043 s
% 0.61/0.74 % Total time : 0.669 s
% 0.61/0.74 % Maximum resident set size: 5632 pages
% 0.61/0.74 % E exiting
%------------------------------------------------------------------------------