%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO282+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 : n007.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 1.93s 0.72s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 24 unt; 0 def)
% Number of atoms : 196 ( 67 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 238 ( 95 ~; 81 |; 55 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 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 : 74 ( 0 sgn 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(147), 0), imp(cond(axiom(147), 0)))',axiom,
! [X30,X31,X32,X33] :
( ( rreal(X31)
& X30 = X31
& rreal(X33)
& X32 = X33
& rless(X30,X32) )
=> ( X30 = X32
| ~ rless(X32,X30) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(147), 0), imp(cond(axiom(147), 0)))') ).
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(186), 0), imp(cond(axiom(186), 0)))',axiom,
! [X11,X12,X13,X14] :
( ( ? [X16] :
( rpoint(X16)
& X11 = X16 )
& ? [X15] :
( rpoint(X15)
& X12 = X15 )
& rcenter(X13,X14)
& ron(X12,X14) )
=> ( rless(vf(X13,X11),vf(X13,X12))
<=> rinside(X11,X14) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))') ).
fof('holds(252, 1144, 0)',axiom,
vd1123 = vd1127,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(252, 1144, 0)') ).
fof('neg(neg(254))',conjecture,
~ rinside(vd1125,vd1146),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','neg(neg(254))') ).
fof('qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))',axiom,
! [X23,X24] :
( ( ? [X26] :
( rpoint(X26)
& X23 = X26 )
& ? [X25] :
( rpoint(X25)
& X24 = X25 ) )
=> ? [X27] :
( rreal(X27)
& vf(X23,X24) = X27 ) ),
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(253))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct2(comma_conjunct2(253)), 0), pred(comma_conjunct1(comma_conjunct2(253)), 0)))), pred(comma_conjunct1(253), 0))',axiom,
( ron(vd1123,vd1145)
& ron(vd1125,vd1145)
& rcircle(vd1146)
& rcenter(vd1123,vd1146)
& ron(vd1129,vd1146) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct2(comma_conjunct2(253)), 0), pred(comma_conjunct1(comma_conjunct2(253)), 0)))), pred(comma_conjunct1(253), 0))') ).
fof('qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))',axiom,
! [X28,X29] :
( ( rreal(X29)
& X28 = X29 )
=> ~ rless(X28,X28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))') ).
fof(c_0_8,plain,
! [X30,X31,X32,X33] :
( ( rreal(X31)
& X30 = X31
& rreal(X33)
& X32 = X33
& rless(X30,X32) )
=> ( X30 = X32
| ~ rless(X32,X30) ) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(147), 0), imp(cond(axiom(147), 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,
! [X766,X767,X768,X769] :
( X766 = X768
| ~ rless(X768,X766)
| ~ rreal(X767)
| X766 != X767
| ~ rreal(X769)
| X768 != X769
| ~ rless(X766,X768) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,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_12,plain,
! [X747,X748,X749,X750,X751,X752] :
( ( ~ rpoint(X752)
| X747 != X752
| ~ rpoint(X751)
| X748 != X751
| ~ rcenter(X749,X750)
| ~ ron(X748,X750)
| rless(vf(X749,X747),vf(X749,X748))
| ~ rinside(X747,X750) )
& ( ~ rpoint(X752)
| X747 != X752
| ~ rpoint(X751)
| X748 != X751
| ~ rcenter(X749,X750)
| ~ ron(X748,X750)
| rinside(X747,X750)
| ~ rless(vf(X749,X747),vf(X749,X748)) ) ),
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_13,plain,
( ~ rless(X2,X1)
| ~ rreal(X4)
| X1 != X4
| ~ rreal(X3)
| X2 != X3
| ~ rless(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
rless(vf(vd1127,vd1129),vf(vd1123,vd1125)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
vd1123 = vd1127,
inference(split_conjunct,[status(thm)],['holds(252, 1144, 0)']) ).
cnf(c_0_16,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_12]) ).
fof(c_0_17,negated_conjecture,
~ ~ rinside(vd1125,vd1146),
inference(assume_negation,[status(cth)],['neg(neg(254))']) ).
fof(c_0_18,plain,
! [X759,X760,X761,X762] :
( ( ~ rpoint(X762)
| X759 != X762
| ~ rpoint(X761)
| X760 != X761
| rreal(esk3_2(X759,X760)) )
& ( ~ rpoint(X762)
| X759 != X762
| ~ rpoint(X761)
| X760 != X761
| vf(X759,X760) = esk3_2(X759,X760) ) ),
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_19,plain,
( ~ rless(X1,X2)
| ~ rless(X2,X1)
| ~ rreal(X2)
| ~ rreal(X1)
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]) ).
cnf(c_0_20,plain,
rless(vf(vd1123,vd1129),vf(vd1123,vd1125)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,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_16])]) ).
cnf(c_0_22,plain,
rcenter(vd1123,vd1146),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct2(comma_conjunct2(253)), 0), pred(comma_conjunct1(comma_conjunct2(253)), 0)))), pred(comma_conjunct1(253), 0))']) ).
cnf(c_0_23,plain,
rpoint(vd1126),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
vd1125 = vd1126,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
rpoint(vd1130),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
vd1129 = vd1130,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_27,negated_conjecture,
rinside(vd1125,vd1146),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| rreal(esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) = esk3_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
vd1127 = vd1128,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( ~ rless(vf(vd1123,vd1125),vf(vd1123,vd1129))
| ~ rreal(vf(vd1123,vd1129))
| ~ rreal(vf(vd1123,vd1125))
| vf(vd1123,vd1125) = vf(vd1123,vd1129) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_32,plain,
( ~ rinside(X1,vd1146)
| ~ ron(X2,vd1146)
| ~ rpoint(X2)
| ~ rpoint(X1)
| rless(vf(vd1123,X1),vf(vd1123,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_33,plain,
rpoint(vd1125),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
rpoint(vd1129),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
ron(vd1129,vd1146),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(253))), 0), and(pred(comma_conjunct2(comma_conjunct2(253)), 0), pred(comma_conjunct1(comma_conjunct2(253)), 0)))), pred(comma_conjunct1(253), 0))']) ).
cnf(c_0_36,negated_conjecture,
rinside(vd1125,vd1146),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(esk3_2(X1,X2)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]) ).
cnf(c_0_38,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| esk3_2(X1,X2) = vf(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).
cnf(c_0_39,plain,
rpoint(vd1128),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,plain,
vd1128 = vd1123,
inference(rw,[status(thm)],[c_0_30,c_0_15]) ).
fof(c_0_41,plain,
! [X28,X29] :
( ( rreal(X29)
& X28 = X29 )
=> ~ rless(X28,X28) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))']) ).
cnf(c_0_42,plain,
( ~ rreal(vf(vd1123,vd1129))
| ~ rreal(vf(vd1123,vd1125))
| vf(vd1123,vd1125) = vf(vd1123,vd1129) ),
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_31,c_0_32]),c_0_33]),c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rreal(vf(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
rpoint(vd1123),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_45,plain,
! [X764,X765] :
( ~ rless(X764,X764)
| ~ rreal(X765)
| X764 != X765 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).
cnf(c_0_46,plain,
( ~ rreal(vf(vd1123,vd1129))
| vf(vd1123,vd1125) = vf(vd1123,vd1129) ),
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_33])]) ).
cnf(c_0_47,plain,
( ~ rless(X1,X1)
| ~ rreal(X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_48,plain,
vf(vd1123,vd1125) = vf(vd1123,vd1129),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_44]),c_0_34])]) ).
cnf(c_0_49,plain,
( ~ rless(X1,X1)
| ~ rreal(X1) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_50,plain,
rless(vf(vd1123,vd1129),vf(vd1123,vd1129)),
inference(rw,[status(thm)],[c_0_20,c_0_48]) ).
cnf(c_0_51,plain,
rreal(vf(vd1123,vd1129)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_48]),c_0_44]),c_0_33])]) ).
cnf(c_0_52,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO282+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.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 15:04:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 1.93/0.72 % Version: 3.5.1
% 1.93/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.93/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.93/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.93/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.93/0.72 % Starting sh5l with 300s (1) cores
% 1.93/0.72 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3085142 completed with status 0
% 1.93/0.72 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.93/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.93/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.93/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.93/0.72 % No SInE strategy applied
% 1.93/0.72 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.93/0.72 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.93/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.93/0.72 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.93/0.72 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.93/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.93/0.72 % SubtermCWHack with pid 3085149 completed with status 0
% 1.93/0.72 % Result found by SubtermCWHack
% 1.93/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.93/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.93/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.93/0.72 % No SInE strategy applied
% 1.93/0.72 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.93/0.72 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.93/0.72 % Preprocessing time : 0.007 s
% 1.93/0.72
% 1.93/0.72 % Proof found!
% 1.93/0.72 % SZS status Theorem
% 1.93/0.72 % SZS output start CNFRefutation
% See solution above
% 1.93/0.72 % Parsed axioms : 124
% 1.93/0.72 % Removed by relevancy pruning/SinE : 0
% 1.93/0.72 % Initial clauses : 288
% 1.93/0.72 % Removed in clause preprocessing : 2
% 1.93/0.72 % Initial clauses in saturation : 286
% 1.93/0.72 % Processed clauses : 2031
% 1.93/0.72 % ...of these trivial : 19
% 1.93/0.72 % ...subsumed : 1302
% 1.93/0.72 % ...remaining for further processing : 710
% 1.93/0.72 % Other redundant clauses eliminated : 1115
% 1.93/0.72 % Clauses deleted for lack of memory : 0
% 1.93/0.72 % Backward-subsumed : 34
% 1.93/0.72 % Backward-rewritten : 30
% 1.93/0.72 % Generated clauses : 3679
% 1.93/0.72 % ...of the previous two non-redundant : 3436
% 1.93/0.72 % ...aggressively subsumed : 0
% 1.93/0.72 % Contextual simplify-reflections : 54
% 1.93/0.72 % Paramodulations : 3423
% 1.93/0.72 % Factorizations : 0
% 1.93/0.72 % NegExts : 0
% 1.93/0.72 % Equation resolutions : 1122
% 1.93/0.72 % Disequality decompositions : 0
% 1.93/0.72 % Total rewrite steps : 2497
% 1.93/0.72 % ...of those cached : 2475
% 1.93/0.72 % Propositional unsat checks : 0
% 1.93/0.72 % Propositional check models : 0
% 1.93/0.72 % Propositional check unsatisfiable : 0
% 1.93/0.72 % Propositional clauses : 0
% 1.93/0.72 % Propositional clauses after purity: 0
% 1.93/0.72 % Propositional unsat core size : 0
% 1.93/0.72 % Propositional preprocessing time : 0.000
% 1.93/0.72 % Propositional encoding time : 0.000
% 1.93/0.72 % Propositional solver time : 0.000
% 1.93/0.72 % Success case prop preproc time : 0.000
% 1.93/0.72 % Success case prop encoding time : 0.000
% 1.93/0.72 % Success case prop solver time : 0.000
% 1.93/0.72 % Current number of processed clauses : 403
% 1.93/0.72 % Positive orientable unit clauses : 27
% 1.93/0.72 % Positive unorientable unit clauses: 0
% 1.93/0.72 % Negative unit clauses : 10
% 1.93/0.72 % Non-unit-clauses : 366
% 1.93/0.72 % Current number of unprocessed clauses: 1545
% 1.93/0.72 % ...number of literals in the above : 11912
% 1.93/0.72 % Current number of archived formulas : 0
% 1.93/0.72 % Current number of archived clauses : 64
% 1.93/0.72 % Clause-clause subsumption calls (NU) : 184003
% 1.93/0.72 % Rec. Clause-clause subsumption calls : 6834
% 1.93/0.72 % Non-unit clause-clause subsumptions : 976
% 1.93/0.72 % Unit Clause-clause subsumption calls : 1023
% 1.93/0.72 % Rewrite failures with RHS unbound : 0
% 1.93/0.72 % BW rewrite match attempts : 10
% 1.93/0.72 % BW rewrite match successes : 10
% 1.93/0.72 % Condensation attempts : 0
% 1.93/0.72 % Condensation successes : 0
% 1.93/0.72 % Termbank termtop insertions : 131994
% 1.93/0.72 % Search garbage collected termcells : 14019
% 1.93/0.72
% 1.93/0.72 % -------------------------------------------------
% 1.93/0.72 % User time : 0.270 s
% 1.93/0.72 % System time : 0.009 s
% 1.93/0.72 % Total time : 0.279 s
% 1.93/0.72 % Maximum resident set size: 6012 pages
% 1.93/0.72
% 1.93/0.72 % -------------------------------------------------
% 1.93/0.72 % User time : 1.144 s
% 1.93/0.72 % System time : 0.035 s
% 1.93/0.72 % Total time : 1.179 s
% 1.93/0.72 % Maximum resident set size: 5376 pages
% 1.93/0.72 % E exiting
%------------------------------------------------------------------------------