%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO344+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 : n010.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:11 PM UTC 2026
% Result : Theorem 0.14s 11.00s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 148 ( 59 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 175 ( 58 ~; 44 |; 69 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn 18 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X16,X17,X18,X19] :
( ( ? [X23] :
( rpoint(X23)
& X16 = X23 )
& ? [X22] :
( rpoint(X22)
& X17 = X22 )
& X16 != X17
& ? [X21] :
( rline(X21)
& X18 = X21 )
& ? [X20] :
( rline(X20)
& X19 = X20 )
& ron(X16,X18)
& ron(X16,X19)
& ron(X17,X18)
& ron(X17,X19) )
=> X18 = X19 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))',axiom,
( ? [X4] :
( rpoint(X4)
& vd1399 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1400 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).
fof('qu(theu(the(409), 1), imp(the(409)))',conjecture,
! [X1] :
( ( rline(X1)
& ron(vd1401,X1)
& ron(vd1409,X1) )
=> X1 = vd1419 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(theu(the(409), 1), imp(the(409)))') ).
fof('holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)',axiom,
vd1409 != vd1401,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)') ).
fof('pred(406, 0)',axiom,
rpoint(vd1409),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(406, 0)') ).
fof('and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))',axiom,
( rline(vd1419)
& ron(vd1401,vd1419)
& ron(vd1409,vd1419) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))') ).
fof(c_0_6,plain,
! [X16,X17,X18,X19] :
( ( ? [X23] :
( rpoint(X23)
& X16 = X23 )
& ? [X22] :
( rpoint(X22)
& X17 = X22 )
& X16 != X17
& ? [X21] :
( rline(X21)
& X18 = X21 )
& ? [X20] :
( rline(X20)
& X19 = X20 )
& ron(X16,X18)
& ron(X16,X19)
& ron(X17,X18)
& ron(X17,X19) )
=> X18 = X19 ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))']) ).
fof(c_0_7,plain,
( ? [X4] :
( rpoint(X4)
& vd1399 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1400 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))']) ).
fof(c_0_8,plain,
! [X794,X795,X796,X797,X798,X799,X800,X801] :
( X796 = X797
| ~ rpoint(X801)
| X794 != X801
| ~ rpoint(X800)
| X795 != X800
| X794 = X795
| ~ rline(X799)
| X796 != X799
| ~ rline(X798)
| X797 != X798
| ~ ron(X794,X796)
| ~ ron(X794,X797)
| ~ ron(X795,X796)
| ~ ron(X795,X797) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( rline(X1)
& ron(vd1401,X1)
& ron(vd1409,X1) )
=> X1 = vd1419 ),
inference(assume_negation,[status(cth)],['qu(theu(the(409), 1), imp(the(409)))']) ).
fof(c_0_10,plain,
( rpoint(esk4_0)
& vd1399 = esk4_0
& rpoint(esk3_0)
& vd1400 = esk3_0
& rpoint(esk2_0)
& vd1401 = esk2_0
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( ~ rpoint(X8)
| X4 != X8
| ~ rpoint(X7)
| X1 != X7
| ~ rline(X6)
| X3 != X6
| ~ rline(X5)
| X2 != X5
| ~ ron(X4,X3)
| ~ ron(X4,X2)
| ~ ron(X1,X3)
| ~ ron(X1,X2)
| X3 = X2
| X4 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( esk1_0 != vd1419
& rline(esk1_0)
& ron(vd1401,esk1_0)
& ron(vd1409,esk1_0) ),
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_13,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
vd1401 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
vd1409 != vd1401,
inference(fof_simplification,[status(thm)],['holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)']) ).
cnf(c_0_16,plain,
( ~ ron(X3,X1)
| ~ ron(X3,X2)
| ~ ron(X4,X1)
| ~ ron(X4,X2)
| ~ rline(X1)
| ~ rline(X2)
| ~ rpoint(X3)
| ~ rpoint(X4)
| X3 = X4
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_17,negated_conjecture,
ron(vd1401,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
vd1409 != vd1401,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ ron(X1,X2)
| ~ ron(X1,esk1_0)
| ~ ron(vd1401,X2)
| ~ rline(X2)
| ~ rpoint(X1)
| X2 = esk1_0
| X1 = vd1401 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
ron(vd1409,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
rpoint(vd1409),
inference(split_conjunct,[status(thm)],['pred(406, 0)']) ).
cnf(c_0_24,plain,
vd1409 != vd1401,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ ron(vd1409,X1)
| ~ ron(vd1401,X1)
| ~ rline(X1)
| X1 = esk1_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_26,plain,
rline(vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_27,plain,
ron(vd1401,vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_28,plain,
ron(vd1409,vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_29,negated_conjecture,
esk1_0 != vd1419,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[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])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO344+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.79 % Computer : n010.cluster.edu
% 0.10/10.79 % Model : x86_64 x86_64
% 0.10/10.79 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.79 % Memory : 8046.5625MB
% 0.10/10.79 % OS : Linux 6.8.0-71-generic
% 0.10/10.79 % CPULimit : 300
% 0.10/10.79 % WCLimit : 300
% 0.10/10.79 % DateTime : Sun Sep 20 15:33:08 UTC 2026
% 0.10/10.79 % CPUTime :
% 0.10/10.79 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.84 Running first-order theorem proving
% 0.14/10.84 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.14/11.00 % Version: 3.5.1
% 0.14/11.00 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/11.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/11.00 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/11.00 % Starting new_bool_3 with 300s (1) cores
% 0.14/11.00 % Starting new_bool_1 with 300s (1) cores
% 0.14/11.00 % Starting sh5l with 300s (1) cores
% 0.14/11.00 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3064434 completed with status 0
% 0.14/11.00 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/11.00 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/11.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/11.00 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/11.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/11.00 % No SInE strategy applied
% 0.14/11.00 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.14/11.00 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/11.00 % Starting SubtermCWHack with 136s (1) cores
% 0.14/11.00 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/11.00 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.14/11.00 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/11.00 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.14/11.00 % G-E--_302_C18_F1_URBAN_S0Y with pid 3064443 completed with status 0
% 0.14/11.00 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.14/11.00 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/11.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/11.00 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/11.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/11.00 % No SInE strategy applied
% 0.14/11.00 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.14/11.00 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/11.00 % Starting SubtermCWHack with 136s (1) cores
% 0.14/11.00 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/11.00 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.14/11.00 % Preprocessing time : 0.019 s
% 0.14/11.00
% 0.14/11.00 % Proof found!
% 0.14/11.00 % SZS status Theorem
% 0.14/11.00 % SZS output start CNFRefutation
% See solution above
% 0.14/11.00 % Parsed axioms : 128
% 0.14/11.00 % Removed by relevancy pruning/SinE : 0
% 0.14/11.00 % Initial clauses : 302
% 0.14/11.00 % Removed in clause preprocessing : 2
% 0.14/11.00 % Initial clauses in saturation : 300
% 0.14/11.00 % Processed clauses : 390
% 0.14/11.00 % ...of these trivial : 0
% 0.14/11.00 % ...subsumed : 1
% 0.14/11.00 % ...remaining for further processing : 389
% 0.14/11.00 % Other redundant clauses eliminated : 1197
% 0.14/11.00 % Clauses deleted for lack of memory : 0
% 0.14/11.00 % Backward-subsumed : 1
% 0.14/11.00 % Backward-rewritten : 0
% 0.14/11.00 % Generated clauses : 354
% 0.14/11.00 % ...of the previous two non-redundant : 351
% 0.14/11.00 % ...aggressively subsumed : 0
% 0.14/11.00 % Contextual simplify-reflections : 2
% 0.14/11.00 % Paramodulations : 90
% 0.14/11.00 % Factorizations : 0
% 0.14/11.00 % NegExts : 0
% 0.14/11.00 % Equation resolutions : 1206
% 0.14/11.00 % Disequality decompositions : 0
% 0.14/11.00 % Total rewrite steps : 88
% 0.14/11.00 % ...of those cached : 69
% 0.14/11.00 % Propositional unsat checks : 0
% 0.14/11.00 % Propositional check models : 0
% 0.14/11.00 % Propositional check unsatisfiable : 0
% 0.14/11.00 % Propositional clauses : 0
% 0.14/11.00 % Propositional clauses after purity: 0
% 0.14/11.00 % Propositional unsat core size : 0
% 0.14/11.00 % Propositional preprocessing time : 0.000
% 0.14/11.00 % Propositional encoding time : 0.000
% 0.14/11.00 % Propositional solver time : 0.000
% 0.14/11.00 % Success case prop preproc time : 0.000
% 0.14/11.00 % Success case prop encoding time : 0.000
% 0.14/11.00 % Success case prop solver time : 0.000
% 0.14/11.00 % Current number of processed clauses : 133
% 0.14/11.00 % Positive orientable unit clauses : 29
% 0.14/11.00 % Positive unorientable unit clauses: 0
% 0.14/11.00 % Negative unit clauses : 10
% 0.14/11.00 % Non-unit-clauses : 94
% 0.14/11.00 % Current number of unprocessed clauses: 259
% 0.14/11.00 % ...number of literals in the above : 2389
% 0.14/11.00 % Current number of archived formulas : 0
% 0.14/11.00 % Current number of archived clauses : 1
% 0.14/11.00 % Clause-clause subsumption calls (NU) : 24428
% 0.14/11.00 % Rec. Clause-clause subsumption calls : 954
% 0.14/11.00 % Non-unit clause-clause subsumptions : 3
% 0.14/11.00 % Unit Clause-clause subsumption calls : 65
% 0.14/11.00 % Rewrite failures with RHS unbound : 0
% 0.14/11.00 % BW rewrite match attempts : 0
% 0.14/11.00 % BW rewrite match successes : 0
% 0.14/11.00 % Condensation attempts : 0
% 0.14/11.00 % Condensation successes : 0
% 0.14/11.00 % Termbank termtop insertions : 70048
% 0.14/11.00 % Search garbage collected termcells : 15667
% 0.14/11.00
% 0.14/11.00 % -------------------------------------------------
% 0.14/11.00 % User time : 0.125 s
% 0.14/11.00 % System time : 0.011 s
% 0.14/11.00 % Total time : 0.136 s
% 0.14/11.00 % Maximum resident set size: 6312 pages
% 0.14/11.00
% 0.14/11.00 % -------------------------------------------------
% 0.14/11.00 % User time : 0.483 s
% 0.14/11.00 % System time : 0.037 s
% 0.14/11.00 % Total time : 0.520 s
% 0.14/11.00 % Maximum resident set size: 5632 pages
% 0.14/11.00 % E exiting
%------------------------------------------------------------------------------