%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO340+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 : n015.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:10 PM UTC 2026
% Result : Theorem 4.12s 1.21s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 24 unt; 0 def)
% Number of atoms : 260 ( 128 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 335 ( 123 ~; 101 |; 102 &)
% ( 0 <=>; 9 =>; 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 : 109 ( 1 sgn 51 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof('neg(neg(403))',conjecture,
~ ? [X1] :
( rpoint(X1)
& rS(vd1386,X1,vd1391)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& vf(vd1385,vd1386) = vf(vd1385,X1)
& X1 != vd1386 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','neg(neg(403))') ).
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,
( ? [X4] :
( rpoint(X4)
& vd1384 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1385 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1386 = X2 )
& vd1384 != vd1385
& vd1384 != vd1386
& vd1385 != vd1386
& rline(vd1392)
& ron(vd1384,vd1391)
& ron(vd1385,vd1391)
& vd1391 = vd1392 ),
file('/export/starexec/sandbox2/benchmark/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('ass(cond(proof(404), 0), 0)',axiom,
! [X5,X6,X7,X8,X9] :
( ( ? [X12] :
( rpoint(X12)
& X5 = X12 )
& ? [X11] :
( rpoint(X11)
& X6 = X11 )
& ? [X10] :
( rpoint(X10)
& X7 = X10 )
& X5 != X6
& X5 != X7
& X6 != X7
& rline(X9)
& ron(X5,X8)
& ron(X6,X8)
& X8 = X9 )
=> ! [X13] :
( ( rpoint(X13)
& rS(X7,X13,X8)
& vf(X5,X7) = vf(X5,X13)
& vf(X6,X7) = vf(X6,X13)
& X13 != X7 )
=> ! [X14] :
( X14 = vskolem1416(X13,X5,X6,X7,X8,X9)
=> ! [X15] : X15 != vskolem1419(X14,X13,X5,X6,X7,X8,X9) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(404), 0), 0)') ).
fof('qu(cond(axiom(97), 0), imp(cond(axiom(97), 0)))',axiom,
! [X132,X133,X134,X135] :
( ( ? [X137] :
( rpoint(X137)
& X132 = X137 )
& ? [X136] :
( rpoint(X136)
& X133 = X136 )
& rline(X135)
& X134 = X135
& rS(X132,X133,X134) )
=> rS(X133,X132,X134) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(97), 0), imp(cond(axiom(97), 0)))') ).
fof('qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))',axiom,
! [X126,X127,X128,X129] :
( ( ? [X131] :
( rpoint(X131)
& X126 = X131 )
& ? [X130] :
( rpoint(X130)
& X127 = X130 )
& rline(X129)
& X128 = X129
& rS(X126,X127,X128) )
=> ~ ron(X126,X128) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))') ).
fof(c_0_5,negated_conjecture,
~ ~ ? [X1] :
( rpoint(X1)
& rS(vd1386,X1,vd1391)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& vf(vd1385,vd1386) = vf(vd1385,X1)
& X1 != vd1386 ),
inference(assume_negation,[status(cth)],['neg(neg(403))']) ).
fof(c_0_6,plain,
( ? [X4] :
( rpoint(X4)
& vd1384 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1385 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1386 = X2 )
& vd1384 != vd1385
& vd1384 != vd1386
& vd1385 != vd1386
& rline(vd1392)
& ron(vd1384,vd1391)
& ron(vd1385,vd1391)
& vd1391 = vd1392 ),
inference(fof_simplification,[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))))))))))))']) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X9] :
( ( ? [X12] :
( rpoint(X12)
& X5 = X12 )
& ? [X11] :
( rpoint(X11)
& X6 = X11 )
& ? [X10] :
( rpoint(X10)
& X7 = X10 )
& X5 != X6
& X5 != X7
& X6 != X7
& rline(X9)
& ron(X5,X8)
& ron(X6,X8)
& X8 = X9 )
=> ! [X13] :
( ( rpoint(X13)
& rS(X7,X13,X8)
& vf(X5,X7) = vf(X5,X13)
& vf(X6,X7) = vf(X6,X13)
& X13 != X7 )
=> ! [X14] :
( X14 = vskolem1416(X13,X5,X6,X7,X8,X9)
=> ! [X15] : X15 != vskolem1419(X14,X13,X5,X6,X7,X8,X9) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(404), 0), 0)']) ).
fof(c_0_8,plain,
! [X1035,X1036,X1037,X1038,X1039,X1040] :
( rS(X1036,X1035,X1037)
| ~ rpoint(X1040)
| X1035 != X1040
| ~ rpoint(X1039)
| X1036 != X1039
| ~ rline(X1038)
| X1037 != X1038
| ~ rS(X1035,X1036,X1037) ),
inference(fof_nnf,[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,
~ ~ ? [X1] :
( rpoint(X1)
& rS(vd1386,X1,vd1391)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& vf(vd1385,vd1386) = vf(vd1385,X1)
& X1 != vd1386 ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
( rpoint(esk4_0)
& vd1384 = esk4_0
& rpoint(esk3_0)
& vd1385 = esk3_0
& rpoint(esk2_0)
& vd1386 = esk2_0
& vd1384 != vd1385
& vd1384 != vd1386
& vd1385 != vd1386
& rline(vd1392)
& ron(vd1384,vd1391)
& ron(vd1385,vd1391)
& vd1391 = vd1392 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X794,X795,X796,X797,X798,X799,X800,X801,X802,X803,X804] :
( X804 != vskolem1419(X803,X802,X794,X795,X796,X797,X798)
| X803 != vskolem1416(X802,X794,X795,X796,X797,X798)
| ~ rpoint(X802)
| ~ rS(X796,X802,X797)
| vf(X794,X796) != vf(X794,X802)
| vf(X795,X796) != vf(X795,X802)
| X802 = X796
| ~ rpoint(X801)
| X794 != X801
| ~ rpoint(X800)
| X795 != X800
| ~ rpoint(X799)
| X796 != X799
| X794 = X795
| X794 = X796
| X795 = X796
| ~ rline(X798)
| ~ ron(X794,X797)
| ~ ron(X795,X797)
| X797 != X798 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rline(X4)
| X3 != X4
| ~ rS(X1,X2,X3)
| rS(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
( rpoint(esk1_0)
& rS(vd1386,esk1_0,vd1391)
& vf(vd1384,vd1386) = vf(vd1384,esk1_0)
& vf(vd1385,vd1386) = vf(vd1385,esk1_0)
& esk1_0 != vd1386 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
rline(vd1392),
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,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
vd1386 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X126,X127,X128,X129] :
( ( ? [X131] :
( rpoint(X131)
& X126 = X131 )
& ? [X130] :
( rpoint(X130)
& X127 = X130 )
& rline(X129)
& X128 = X129
& rS(X126,X127,X128) )
=> ~ ron(X126,X128) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))']) ).
cnf(c_0_19,plain,
( X11 != vskolem1419(X10,X9,X4,X3,X5,X1,X2)
| X10 != vskolem1416(X9,X4,X3,X5,X1,X2)
| ~ rpoint(X9)
| ~ rS(X5,X9,X1)
| vf(X4,X5) != vf(X4,X9)
| vf(X3,X5) != vf(X3,X9)
| ~ rpoint(X8)
| X4 != X8
| ~ rpoint(X7)
| X3 != X7
| ~ rpoint(X6)
| X5 != X6
| ~ rline(X2)
| ~ ron(X4,X1)
| ~ ron(X3,X1)
| X1 != X2
| X9 = X5
| X4 = X3
| X4 = X5
| X3 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ rS(X2,X1,X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rline(X3)
| rS(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])])]) ).
cnf(c_0_21,negated_conjecture,
rS(vd1386,esk1_0,vd1391),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
rline(vd1391),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
rpoint(vd1386),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X1029,X1030,X1031,X1032,X1033,X1034] :
( ~ ron(X1029,X1031)
| ~ rpoint(X1034)
| X1029 != X1034
| ~ rpoint(X1033)
| X1030 != X1033
| ~ rline(X1032)
| X1031 != X1032
| ~ rS(X1029,X1030,X1031) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_26,plain,
( ~ rS(X1,X2,X5)
| ~ rpoint(X1)
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ ron(X4,X5)
| ~ ron(X3,X5)
| ~ rline(X5)
| vf(X4,X1) != vf(X4,X2)
| vf(X3,X1) != vf(X3,X2)
| X4 = X3
| X4 = X1
| X3 = X1
| X1 = X2 ),
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_19])])])])])]) ).
cnf(c_0_27,negated_conjecture,
rS(esk1_0,vd1386,vd1391),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 != vd1386,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
vd1384 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( ~ ron(X1,X3)
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rline(X4)
| X3 != X4
| ~ rS(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ~ ron(X2,vd1391)
| ~ ron(X1,vd1391)
| vf(X2,esk1_0) != vf(X2,vd1386)
| vf(X1,esk1_0) != vf(X1,vd1386)
| X2 = X1
| X2 = esk1_0
| X1 = esk1_0 ),
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_22]),c_0_23]),c_0_24])]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
vf(vd1384,vd1386) = vf(vd1384,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
ron(vd1384,vd1391),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,plain,
rpoint(vd1384),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
vd1385 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,plain,
( ~ rS(X2,X3,X1)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ ron(X2,X1)
| ~ rline(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,vd1391)
| vf(X1,esk1_0) != vf(X1,vd1386)
| X1 = esk1_0
| X1 = vd1384
| esk1_0 = vd1384 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
vf(vd1385,vd1386) = vf(vd1385,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,plain,
ron(vd1385,vd1391),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,plain,
rpoint(vd1385),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
vd1384 != vd1385,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,negated_conjecture,
~ ron(esk1_0,vd1391),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_22]),c_0_24]),c_0_23])]) ).
cnf(c_0_45,negated_conjecture,
( esk1_0 = vd1384
| esk1_0 = vd1385 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
esk1_0 = vd1385,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_46]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO340+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n015.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 20 15:34:20 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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
% 4.12/1.21 % Version: 3.5.1
% 4.12/1.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.12/1.21 % Starting new_bool_3 with 300s (1) cores
% 4.12/1.21 % Starting new_bool_1 with 300s (1) cores
% 4.12/1.21 % Starting sh5l with 300s (1) cores
% 4.12/1.21 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3472855 completed with status 0
% 4.12/1.21 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.12/1.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.12/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.12/1.21 % No SInE strategy applied
% 4.12/1.21 % Search class: FGHSF-FSLM33-SFFFFFNN
% 4.12/1.21 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.12/1.21 % Starting SubtermCWHack with 136s (1) cores
% 4.12/1.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.12/1.21 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 4.12/1.21 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 4.12/1.21 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.12/1.21 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3472866 completed with status 0
% 4.12/1.21 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 4.12/1.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.12/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.12/1.21 % No SInE strategy applied
% 4.12/1.21 % Search class: FGHSF-FSLM33-SFFFFFNN
% 4.12/1.21 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.12/1.21 % Starting SubtermCWHack with 136s (1) cores
% 4.12/1.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.12/1.21 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 4.12/1.21 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 4.12/1.21 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.12/1.21 % Preprocessing time : 0.029 s
% 4.12/1.21 % Presaturation interreduction done
% 4.12/1.21
% 4.12/1.21 % Proof found!
% 4.12/1.21 % SZS status Theorem
% 4.12/1.21 % SZS output start CNFRefutation
% See solution above
% 4.12/1.21 % Parsed axioms : 124
% 4.12/1.21 % Removed by relevancy pruning/SinE : 0
% 4.12/1.21 % Initial clauses : 299
% 4.12/1.21 % Removed in clause preprocessing : 2
% 4.12/1.21 % Initial clauses in saturation : 297
% 4.12/1.21 % Processed clauses : 1354
% 4.12/1.21 % ...of these trivial : 82
% 4.12/1.21 % ...subsumed : 100
% 4.12/1.21 % ...remaining for further processing : 1172
% 4.12/1.21 % Other redundant clauses eliminated : 1254
% 4.12/1.21 % Clauses deleted for lack of memory : 0
% 4.12/1.21 % Backward-subsumed : 10
% 4.12/1.21 % Backward-rewritten : 107
% 4.12/1.21 % Generated clauses : 4035
% 4.12/1.21 % ...of the previous two non-redundant : 3698
% 4.12/1.21 % ...aggressively subsumed : 0
% 4.12/1.21 % Contextual simplify-reflections : 15
% 4.12/1.21 % Paramodulations : 3751
% 4.12/1.21 % Factorizations : 9
% 4.12/1.21 % NegExts : 0
% 4.12/1.21 % Equation resolutions : 1256
% 4.12/1.21 % Disequality decompositions : 0
% 4.12/1.21 % Total rewrite steps : 5716
% 4.12/1.21 % ...of those cached : 5590
% 4.12/1.21 % Propositional unsat checks : 0
% 4.12/1.21 % Propositional check models : 0
% 4.12/1.21 % Propositional check unsatisfiable : 0
% 4.12/1.21 % Propositional clauses : 0
% 4.12/1.21 % Propositional clauses after purity: 0
% 4.12/1.21 % Propositional unsat core size : 0
% 4.12/1.21 % Propositional preprocessing time : 0.000
% 4.12/1.21 % Propositional encoding time : 0.000
% 4.12/1.21 % Propositional solver time : 0.000
% 4.12/1.21 % Success case prop preproc time : 0.000
% 4.12/1.21 % Success case prop encoding time : 0.000
% 4.12/1.21 % Success case prop solver time : 0.000
% 4.12/1.21 % Current number of processed clauses : 498
% 4.12/1.21 % Positive orientable unit clauses : 138
% 4.12/1.21 % Positive unorientable unit clauses: 0
% 4.12/1.21 % Negative unit clauses : 27
% 4.12/1.21 % Non-unit-clauses : 333
% 4.12/1.21 % Current number of unprocessed clauses: 2805
% 4.12/1.21 % ...number of literals in the above : 10188
% 4.12/1.21 % Current number of archived formulas : 0
% 4.12/1.21 % Current number of archived clauses : 403
% 4.12/1.21 % Clause-clause subsumption calls (NU) : 282774
% 4.12/1.21 % Rec. Clause-clause subsumption calls : 20067
% 4.12/1.21 % Non-unit clause-clause subsumptions : 63
% 4.12/1.21 % Unit Clause-clause subsumption calls : 17617
% 4.12/1.21 % Rewrite failures with RHS unbound : 0
% 4.12/1.21 % BW rewrite match attempts : 1108
% 4.12/1.21 % BW rewrite match successes : 5
% 4.12/1.21 % Condensation attempts : 0
% 4.12/1.21 % Condensation successes : 0
% 4.12/1.21 % Termbank termtop insertions : 201061
% 4.12/1.21 % Search garbage collected termcells : 16282
% 4.12/1.21
% 4.12/1.21 % -------------------------------------------------
% 4.12/1.21 % User time : 0.569 s
% 4.12/1.21 % System time : 0.027 s
% 4.12/1.21 % Total time : 0.596 s
% 4.12/1.21 % Maximum resident set size: 6272 pages
% 4.12/1.21
% 4.12/1.21 % -------------------------------------------------
% 4.12/1.21 % User time : 2.643 s
% 4.12/1.21 % System time : 0.082 s
% 4.12/1.21 % Total time : 2.725 s
% 4.12/1.21 % Maximum resident set size: 5632 pages
% 4.12/1.21 % E exiting
%------------------------------------------------------------------------------