%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO343+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:28:10 PM UTC 2026
% Result : Theorem 0.28s 0.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 146 ( 57 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 172 ( 55 ~; 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 : 10 ( 10 usr; 10 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,
! [X232,X233,X234,X235] :
( ( ? [X239] :
( rpoint(X239)
& X232 = X239 )
& ? [X238] :
( rpoint(X238)
& X233 = X238 )
& X232 != X233
& ? [X237] :
( rline(X237)
& X234 = X237 )
& ? [X236] :
( rline(X236)
& X235 = X236 )
& ron(X232,X234)
& ron(X232,X235)
& ron(X233,X234)
& ron(X233,X235) )
=> X234 = X235 ),
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(408), 1), imp(the(408)))',conjecture,
! [X1] :
( ( rline(X1)
& ron(vd1401,X1)
& ron(vd1399,X1) )
=> X1 = vd1416 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(theu(the(408), 1), imp(the(408)))') ).
fof('and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))',axiom,
( rline(vd1416)
& ron(vd1401,vd1416)
& ron(vd1399,vd1416) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))') ).
fof(c_0_4,plain,
! [X232,X233,X234,X235] :
( ( ? [X239] :
( rpoint(X239)
& X232 = X239 )
& ? [X238] :
( rpoint(X238)
& X233 = X238 )
& X232 != X233
& ? [X237] :
( rline(X237)
& X234 = X237 )
& ? [X236] :
( rline(X236)
& X235 = X236 )
& ron(X232,X234)
& ron(X232,X235)
& ron(X233,X234)
& ron(X233,X235) )
=> X234 = X235 ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))']) ).
fof(c_0_5,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_6,plain,
! [X1075,X1076,X1077,X1078,X1079,X1080,X1081,X1082] :
( X1077 = X1078
| ~ rpoint(X1082)
| X1075 != X1082
| ~ rpoint(X1081)
| X1076 != X1081
| X1075 = X1076
| ~ rline(X1080)
| X1077 != X1080
| ~ rline(X1079)
| X1078 != X1079
| ~ ron(X1075,X1077)
| ~ ron(X1075,X1078)
| ~ ron(X1076,X1077)
| ~ ron(X1076,X1078) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( rline(X1)
& ron(vd1401,X1)
& ron(vd1399,X1) )
=> X1 = vd1416 ),
inference(assume_negation,[status(cth)],['qu(theu(the(408), 1), imp(the(408)))']) ).
fof(c_0_8,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_5])])]) ).
cnf(c_0_9,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_6]) ).
fof(c_0_10,negated_conjecture,
( esk1_0 != vd1416
& rline(esk1_0)
& ron(vd1401,esk1_0)
& ron(vd1399,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
vd1401 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_9])])])]) ).
cnf(c_0_14,negated_conjecture,
ron(vd1401,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ ron(X2,X1)
| ~ ron(X2,esk1_0)
| ~ ron(vd1401,X1)
| ~ rline(X1)
| ~ rpoint(X2)
| X2 = vd1401
| X1 = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
ron(vd1401,vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_19,plain,
rline(vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_20,negated_conjecture,
esk1_0 != vd1416,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
vd1399 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( ~ ron(X1,vd1416)
| ~ ron(X1,esk1_0)
| ~ rpoint(X1)
| X1 = vd1401 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
ron(vd1399,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
ron(vd1399,vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_27,plain,
vd1399 != vd1401,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,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_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO343+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % 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.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 15:29:51 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.28/0.62 % Version: 3.5.1
% 0.28/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.28/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.62 % Starting sh5l with 300s (1) cores
% 0.28/0.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2964243 completed with status 0
% 0.28/0.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.28/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.28/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.62 % No SInE strategy applied
% 0.28/0.62 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.28/0.62 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.28/0.62 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.28/0.62 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.28/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.28/0.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2964250 completed with status 0
% 0.28/0.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.28/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.28/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.62 % No SInE strategy applied
% 0.28/0.62 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.28/0.62 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.28/0.62 % Preprocessing time : 0.009 s
% 0.28/0.62 % Presaturation interreduction done
% 0.28/0.62
% 0.28/0.62 % Proof found!
% 0.28/0.62 % SZS status Theorem
% 0.28/0.62 % SZS output start CNFRefutation
% See solution above
% 0.28/0.62 % Parsed axioms : 125
% 0.28/0.62 % Removed by relevancy pruning/SinE : 0
% 0.28/0.62 % Initial clauses : 297
% 0.28/0.62 % Removed in clause preprocessing : 2
% 0.28/0.62 % Initial clauses in saturation : 295
% 0.28/0.62 % Processed clauses : 840
% 0.28/0.62 % ...of these trivial : 9
% 0.28/0.62 % ...subsumed : 38
% 0.28/0.62 % ...remaining for further processing : 793
% 0.28/0.62 % Other redundant clauses eliminated : 1208
% 0.28/0.62 % Clauses deleted for lack of memory : 0
% 0.28/0.62 % Backward-subsumed : 1
% 0.28/0.62 % Backward-rewritten : 7
% 0.28/0.62 % Generated clauses : 783
% 0.28/0.62 % ...of the previous two non-redundant : 754
% 0.28/0.62 % ...aggressively subsumed : 0
% 0.28/0.62 % Contextual simplify-reflections : 8
% 0.28/0.62 % Paramodulations : 519
% 0.28/0.62 % Factorizations : 0
% 0.28/0.62 % NegExts : 0
% 0.28/0.62 % Equation resolutions : 1209
% 0.28/0.62 % Disequality decompositions : 0
% 0.28/0.62 % Total rewrite steps : 257
% 0.28/0.62 % ...of those cached : 226
% 0.28/0.62 % Propositional unsat checks : 0
% 0.28/0.62 % Propositional check models : 0
% 0.28/0.62 % Propositional check unsatisfiable : 0
% 0.28/0.62 % Propositional clauses : 0
% 0.28/0.62 % Propositional clauses after purity: 0
% 0.28/0.62 % Propositional unsat core size : 0
% 0.28/0.62 % Propositional preprocessing time : 0.000
% 0.28/0.62 % Propositional encoding time : 0.000
% 0.28/0.62 % Propositional solver time : 0.000
% 0.28/0.62 % Success case prop preproc time : 0.000
% 0.28/0.62 % Success case prop encoding time : 0.000
% 0.28/0.62 % Success case prop solver time : 0.000
% 0.28/0.62 % Current number of processed clauses : 231
% 0.28/0.62 % Positive orientable unit clauses : 40
% 0.28/0.62 % Positive unorientable unit clauses: 0
% 0.28/0.62 % Negative unit clauses : 10
% 0.28/0.62 % Non-unit-clauses : 181
% 0.28/0.62 % Current number of unprocessed clauses: 419
% 0.28/0.62 % ...number of literals in the above : 3464
% 0.28/0.62 % Current number of archived formulas : 0
% 0.28/0.62 % Current number of archived clauses : 301
% 0.28/0.62 % Clause-clause subsumption calls (NU) : 294380
% 0.28/0.62 % Rec. Clause-clause subsumption calls : 5526
% 0.28/0.62 % Non-unit clause-clause subsumptions : 42
% 0.28/0.62 % Unit Clause-clause subsumption calls : 158
% 0.28/0.62 % Rewrite failures with RHS unbound : 0
% 0.28/0.62 % BW rewrite match attempts : 3
% 0.28/0.62 % BW rewrite match successes : 3
% 0.28/0.62 % Condensation attempts : 0
% 0.28/0.62 % Condensation successes : 0
% 0.28/0.62 % Termbank termtop insertions : 83539
% 0.28/0.62 % Search garbage collected termcells : 15537
% 0.28/0.62
% 0.28/0.62 % -------------------------------------------------
% 0.28/0.62 % User time : 0.157 s
% 0.28/0.62 % System time : 0.009 s
% 0.28/0.62 % Total time : 0.166 s
% 0.28/0.62 % Maximum resident set size: 6052 pages
% 0.28/0.62
% 0.28/0.62 % -------------------------------------------------
% 0.28/0.62 % User time : 0.600 s
% 0.28/0.62 % System time : 0.040 s
% 0.28/0.62 % Total time : 0.640 s
% 0.28/0.62 % Maximum resident set size: 5376 pages
% 0.28/0.62 % E exiting
%------------------------------------------------------------------------------