%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO285+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:28:05 PM UTC 2026
% Result : Theorem 0.17s 0.57s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 55 ( 22 unt; 0 def)
% Number of atoms : 216 ( 69 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 276 ( 115 ~; 97 |; 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 : 12 ( 12 usr; 10 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/sandbox/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(149), 0), imp(cond(axiom(149), 0)))',axiom,
! [X65,X66] :
( ( rreal(X66)
& X65 = X66 )
=> ~ rless(X65,X65) ),
file('/export/starexec/sandbox/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,
! [X251,X252,X253,X254,X255,X256] :
( ( rreal(X252)
& X251 = X252
& rreal(X254)
& X253 = X254
& rreal(X256)
& X255 = X256
& rless(X251,X253)
& rless(X253,X255) )
=> rless(X251,X255) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))') ).
fof('holds(258, 1150, 0)',axiom,
vd1123 = vd1129,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(258, 1150, 0)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X670,X671] :
( ( ? [X673] :
( rpoint(X673)
& X670 = X673 )
& ? [X672] :
( rpoint(X672)
& X671 = X672 ) )
=> vf(X670,X671) = vf(X671,X670) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))',axiom,
! [X15,X16,X17,X18] :
( ( ? [X20] :
( rpoint(X20)
& X15 = X20 )
& ? [X19] :
( rpoint(X19)
& X16 = X19 )
& rcenter(X17,X18)
& ron(X16,X18) )
=> ( rless(vf(X17,X15),vf(X17,X16))
<=> rinside(X15,X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))') ).
fof('neg(neg(260))',conjecture,
~ rinside(vd1125,vd1152),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','neg(neg(260))') ).
fof('qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))',axiom,
! [X60,X61] :
( ( ? [X63] :
( rpoint(X63)
& X60 = X63 )
& ? [X62] :
( rpoint(X62)
& X61 = X62 ) )
=> ? [X64] :
( rreal(X64)
& vf(X60,X61) = X64 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))') ).
fof('and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))',axiom,
( ron(vd1123,vd1151)
& ron(vd1125,vd1151)
& rcircle(vd1152)
& rcenter(vd1123,vd1152)
& ron(vd1127,vd1152) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))') ).
fof(c_0_9,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_10,plain,
! [X65,X66] :
( ( rreal(X66)
& X65 = X66 )
=> ~ rless(X65,X65) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))']) ).
fof(c_0_11,plain,
! [X1001,X1002,X1003,X1004,X1005,X1006] :
( rless(X1001,X1005)
| ~ rreal(X1002)
| X1001 != X1002
| ~ rreal(X1004)
| X1003 != X1004
| ~ rreal(X1006)
| X1005 != X1006
| ~ rless(X1001,X1003)
| ~ rless(X1003,X1005) ),
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)))'])])]) ).
fof(c_0_12,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_9]) ).
fof(c_0_13,plain,
! [X801,X802] :
( ~ rless(X801,X801)
| ~ rreal(X802)
| X801 != X802 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,plain,
rless(vf(vd1127,vd1129),vf(vd1123,vd1125)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
vd1123 = vd1129,
inference(split_conjunct,[status(thm)],['holds(258, 1150, 0)']) ).
cnf(c_0_17,plain,
( ~ rless(X1,X1)
| ~ rreal(X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,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_14])])]) ).
cnf(c_0_19,plain,
rless(vf(vd1127,vd1123),vf(vd1123,vd1125)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X1420,X1421,X1422,X1423] :
( vf(X1420,X1421) = vf(X1421,X1420)
| ~ rpoint(X1423)
| X1420 != X1423
| ~ rpoint(X1422)
| X1421 != X1422 ),
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)))'])])])]) ).
cnf(c_0_21,plain,
vd1129 = vd1130,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X751,X752,X753,X754,X755,X756] :
( ( ~ rpoint(X756)
| X751 != X756
| ~ rpoint(X755)
| X752 != X755
| ~ rcenter(X753,X754)
| ~ ron(X752,X754)
| rless(vf(X753,X751),vf(X753,X752))
| ~ rinside(X751,X754) )
& ( ~ rpoint(X756)
| X751 != X756
| ~ rpoint(X755)
| X752 != X755
| ~ rcenter(X753,X754)
| ~ ron(X752,X754)
| rinside(X751,X754)
| ~ rless(vf(X753,X751),vf(X753,X752)) ) ),
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_23,plain,
( ~ rless(X1,X1)
| ~ rreal(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ rless(vf(vd1123,vd1125),X1)
| ~ rreal(X1)
| ~ rreal(vf(vd1123,vd1125))
| ~ rreal(vf(vd1127,vd1123))
| rless(vf(vd1127,vd1123),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
rpoint(vd1130),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
vd1130 = vd1123,
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_28,plain,
rpoint(vd1128),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
vd1127 = vd1128,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,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_22]) ).
fof(c_0_31,negated_conjecture,
~ ~ rinside(vd1125,vd1152),
inference(assume_negation,[status(cth)],['neg(neg(260))']) ).
fof(c_0_32,plain,
! [X796,X797,X798,X799] :
( ( ~ rpoint(X799)
| X796 != X799
| ~ rpoint(X798)
| X797 != X798
| rreal(esk8_2(X796,X797)) )
& ( ~ rpoint(X799)
| X796 != X799
| ~ rpoint(X798)
| X797 != X798
| vf(X796,X797) = esk8_2(X796,X797) ) ),
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)))'])])])])])]) ).
cnf(c_0_33,plain,
( ~ rless(vf(vd1123,vd1125),vf(vd1127,vd1123))
| ~ rreal(vf(vd1123,vd1125))
| ~ rreal(vf(vd1127,vd1123)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| vf(X1,X2) = vf(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_35,plain,
rpoint(vd1123),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
rpoint(vd1127),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,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_30])]) ).
cnf(c_0_38,plain,
rcenter(vd1123,vd1152),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))']) ).
cnf(c_0_39,plain,
rpoint(vd1126),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
vd1125 = vd1126,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_41,negated_conjecture,
rinside(vd1125,vd1152),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| rreal(esk8_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) = esk8_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( ~ rless(vf(vd1123,vd1125),vf(vd1123,vd1127))
| ~ rreal(vf(vd1123,vd1125))
| ~ rreal(vf(vd1123,vd1127)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_45,plain,
( ~ rinside(X1,vd1152)
| ~ ron(X2,vd1152)
| ~ rpoint(X2)
| ~ rpoint(X1)
| rless(vf(vd1123,X1),vf(vd1123,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
rpoint(vd1125),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
ron(vd1127,vd1152),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))']) ).
cnf(c_0_48,negated_conjecture,
rinside(vd1125,vd1152),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(esk8_2(X1,X2)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_42])]) ).
cnf(c_0_50,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| esk8_2(X1,X2) = vf(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])]) ).
cnf(c_0_51,plain,
( ~ rreal(vf(vd1123,vd1125))
| ~ rreal(vf(vd1123,vd1127)) ),
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_44,c_0_45]),c_0_46]),c_0_36]),c_0_47]),c_0_48])]) ).
cnf(c_0_52,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(vf(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
~ rreal(vf(vd1123,vd1127)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_35]),c_0_46])]) ).
cnf(c_0_54,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO285+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 15:11:10 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.57 % Version: 3.5.1
% 0.17/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 % Starting sh5l with 300s (1) cores
% 0.17/0.57 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3843852 completed with status 0
% 0.17/0.57 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.57 % No SInE strategy applied
% 0.17/0.57 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.17/0.57 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.57 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.17/0.57 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.17/0.57 % SubtermCWHack with pid 3843858 completed with status 0
% 0.17/0.57 % Result found by SubtermCWHack
% 0.17/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.57 % No SInE strategy applied
% 0.17/0.57 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.17/0.57 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.57 % Preprocessing time : 0.007 s
% 0.17/0.57
% 0.17/0.57 % Proof found!
% 0.17/0.57 % SZS status Theorem
% 0.17/0.57 % SZS output start CNFRefutation
% See solution above
% 0.17/0.57 % Parsed axioms : 133
% 0.17/0.57 % Removed by relevancy pruning/SinE : 0
% 0.17/0.57 % Initial clauses : 301
% 0.17/0.57 % Removed in clause preprocessing : 2
% 0.17/0.57 % Initial clauses in saturation : 299
% 0.17/0.57 % Processed clauses : 997
% 0.17/0.57 % ...of these trivial : 20
% 0.17/0.57 % ...subsumed : 560
% 0.17/0.57 % ...remaining for further processing : 417
% 0.17/0.57 % Other redundant clauses eliminated : 411
% 0.17/0.57 % Clauses deleted for lack of memory : 0
% 0.17/0.57 % Backward-subsumed : 14
% 0.17/0.57 % Backward-rewritten : 8
% 0.17/0.57 % Generated clauses : 1412
% 0.17/0.57 % ...of the previous two non-redundant : 1287
% 0.17/0.57 % ...aggressively subsumed : 0
% 0.17/0.57 % Contextual simplify-reflections : 10
% 0.17/0.57 % Paramodulations : 1248
% 0.17/0.57 % Factorizations : 0
% 0.17/0.57 % NegExts : 0
% 0.17/0.57 % Equation resolutions : 418
% 0.17/0.57 % Disequality decompositions : 0
% 0.17/0.57 % Total rewrite steps : 1003
% 0.17/0.57 % ...of those cached : 984
% 0.17/0.57 % Propositional unsat checks : 0
% 0.17/0.57 % Propositional check models : 0
% 0.17/0.57 % Propositional check unsatisfiable : 0
% 0.17/0.57 % Propositional clauses : 0
% 0.17/0.57 % Propositional clauses after purity: 0
% 0.17/0.57 % Propositional unsat core size : 0
% 0.17/0.57 % Propositional preprocessing time : 0.000
% 0.17/0.57 % Propositional encoding time : 0.000
% 0.17/0.57 % Propositional solver time : 0.000
% 0.17/0.57 % Success case prop preproc time : 0.000
% 0.17/0.57 % Success case prop encoding time : 0.000
% 0.17/0.57 % Success case prop solver time : 0.000
% 0.17/0.57 % Current number of processed clauses : 244
% 0.17/0.57 % Positive orientable unit clauses : 24
% 0.17/0.57 % Positive unorientable unit clauses: 0
% 0.17/0.57 % Negative unit clauses : 9
% 0.17/0.57 % Non-unit-clauses : 211
% 0.17/0.57 % Current number of unprocessed clauses: 492
% 0.17/0.57 % ...number of literals in the above : 4669
% 0.17/0.57 % Current number of archived formulas : 0
% 0.17/0.57 % Current number of archived clauses : 22
% 0.17/0.57 % Clause-clause subsumption calls (NU) : 51283
% 0.17/0.57 % Rec. Clause-clause subsumption calls : 6711
% 0.17/0.57 % Non-unit clause-clause subsumptions : 426
% 0.17/0.57 % Unit Clause-clause subsumption calls : 309
% 0.17/0.57 % Rewrite failures with RHS unbound : 0
% 0.17/0.57 % BW rewrite match attempts : 8
% 0.17/0.57 % BW rewrite match successes : 8
% 0.17/0.57 % Condensation attempts : 0
% 0.17/0.57 % Condensation successes : 0
% 0.17/0.57 % Termbank termtop insertions : 71205
% 0.17/0.57 % Search garbage collected termcells : 14037
% 0.17/0.57
% 0.17/0.57 % -------------------------------------------------
% 0.17/0.57 % User time : 0.107 s
% 0.17/0.57 % System time : 0.007 s
% 0.17/0.57 % Total time : 0.114 s
% 0.17/0.57 % Maximum resident set size: 6276 pages
% 0.17/0.57
% 0.17/0.57 % -------------------------------------------------
% 0.17/0.57 % User time : 0.342 s
% 0.17/0.57 % System time : 0.024 s
% 0.17/0.57 % Total time : 0.366 s
% 0.17/0.57 % Maximum resident set size: 5632 pages
% 0.17/0.57 % E exiting
%------------------------------------------------------------------------------