%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO274+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 : n004.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:04 PM UTC 2026
% Result : Theorem 0.15s 5.58s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 27 unt; 0 def)
% Number of atoms : 160 ( 71 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 189 ( 75 ~; 69 |; 39 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 24 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X369,X370,X371,X372] :
( ( ? [X376] :
( rpoint(X376)
& X369 = X376 )
& ? [X375] :
( rpoint(X375)
& X370 = X375 )
& X369 != X370
& ? [X374] :
( rline(X374)
& X371 = X374 )
& ? [X373] :
( rline(X373)
& X372 = X373 )
& ron(X369,X371)
& ron(X369,X372)
& ron(X370,X371)
& ron(X370,X372) )
=> X371 = X372 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('qu(theu(the(227), 1), imp(the(227)))',conjecture,
! [X1] :
( ( rline(X1)
& ron(vd1080,X1)
& ron(vd1089,X1) )
=> X1 = vd1092 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(227), 1), imp(the(227)))') ).
fof('qe(s1(plural(224)))',axiom,
? [X2] :
( rpoint(X2)
& vd1080 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s1(plural(224)))') ).
fof('qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))',axiom,
! [X7,X8] :
( ( ? [X10] :
( rpoint(X10)
& X7 = X10 )
& ? [X9] :
( rpoint(X9)
& X8 = X9 ) )
=> ( vf(X7,X8) = v0
<=> X7 = X8 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).
fof('holds(conjunct1(225), 1087, 0)',axiom,
vd1085 != vd1080,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(225), 1087, 0)') ).
fof('pred(225, 1)',axiom,
rpoint(vd1086),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(225, 1)') ).
fof('pred(225, 4)',axiom,
vd1085 = vd1086,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(225, 4)') ).
fof('pred(226, 0)',axiom,
rpoint(vd1089),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(226, 0)') ).
fof('holds(226, 1090, 1)',axiom,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(226, 1090, 1)') ).
fof('and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))',axiom,
( rline(vd1092)
& ron(vd1080,vd1092)
& ron(vd1089,vd1092) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))') ).
fof(c_0_10,plain,
! [X369,X370,X371,X372] :
( ( ? [X376] :
( rpoint(X376)
& X369 = X376 )
& ? [X375] :
( rpoint(X375)
& X370 = X375 )
& X369 != X370
& ? [X374] :
( rline(X374)
& X371 = X374 )
& ? [X373] :
( rline(X373)
& X372 = X373 )
& ron(X369,X371)
& ron(X369,X372)
& ron(X370,X371)
& ron(X370,X372) )
=> X371 = X372 ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))']) ).
fof(c_0_11,plain,
! [X1110,X1111,X1112,X1113,X1114,X1115,X1116,X1117] :
( X1112 = X1113
| ~ rpoint(X1117)
| X1110 != X1117
| ~ rpoint(X1116)
| X1111 != X1116
| X1110 = X1111
| ~ rline(X1115)
| X1112 != X1115
| ~ rline(X1114)
| X1113 != X1114
| ~ ron(X1110,X1112)
| ~ ron(X1110,X1113)
| ~ ron(X1111,X1112)
| ~ ron(X1111,X1113) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( rline(X1)
& ron(vd1080,X1)
& ron(vd1089,X1) )
=> X1 = vd1092 ),
inference(assume_negation,[status(cth)],['qu(theu(the(227), 1), imp(the(227)))']) ).
fof(c_0_13,plain,
( rpoint(esk2_0)
& vd1080 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(224)))'])]) ).
cnf(c_0_14,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_11]) ).
fof(c_0_15,negated_conjecture,
( esk1_0 != vd1092
& rline(esk1_0)
& ron(vd1080,esk1_0)
& ron(vd1089,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_16,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
vd1080 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X740,X741,X742,X743] :
( ( ~ rpoint(X743)
| X740 != X743
| ~ rpoint(X742)
| X741 != X742
| vf(X740,X741) = v0
| X740 != X741 )
& ( ~ rpoint(X743)
| X740 != X743
| ~ rpoint(X742)
| X741 != X742
| X740 = X741
| vf(X740,X741) != v0 ) ),
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(162), 0), imp(cond(axiom(162), 0)))'])])])])]) ).
fof(c_0_19,plain,
vd1085 != vd1080,
inference(fof_simplification,[status(thm)],['holds(conjunct1(225), 1087, 0)']) ).
cnf(c_0_20,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_14])])])]) ).
cnf(c_0_21,negated_conjecture,
ron(vd1080,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) != v0
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
rpoint(vd1086),
inference(split_conjunct,[status(thm)],['pred(225, 1)']) ).
cnf(c_0_26,plain,
vd1085 = vd1086,
inference(split_conjunct,[status(thm)],['pred(225, 4)']) ).
fof(c_0_27,plain,
vd1085 != vd1080,
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ ron(X1,X2)
| ~ ron(X1,esk1_0)
| ~ ron(vd1080,X2)
| ~ rline(X2)
| ~ rpoint(X1)
| X2 = esk1_0
| X1 = vd1080 ),
inference(cn,[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])]) ).
cnf(c_0_29,negated_conjecture,
ron(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,plain,
rpoint(vd1089),
inference(split_conjunct,[status(thm)],['pred(226, 0)']) ).
cnf(c_0_31,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| vf(X1,X2) != v0
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_32,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
inference(split_conjunct,[status(thm)],['holds(226, 1090, 1)']) ).
cnf(c_0_33,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
vd1085 != vd1080,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ ron(vd1089,X1)
| ~ ron(vd1080,X1)
| ~ rline(X1)
| X1 = esk1_0
| vd1089 = vd1080 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_36,plain,
rline(vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_37,plain,
ron(vd1080,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_38,plain,
ron(vd1089,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_39,negated_conjecture,
esk1_0 != vd1092,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,plain,
vf(vd1089,vd1080) != v0,
inference(sr,[status(thm)],[inference(cn,[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_22])]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
vd1089 = vd1080,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_42,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| X1 != X2
| vf(X1,X2) = v0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
vf(vd1080,vd1080) != v0,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ rpoint(X1)
| vf(X1,X1) = v0 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_42])])]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO274+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.12/5.38 % Computer : n004.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Sun Sep 20 15:02:41 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.58 % Version: 3.5.1
% 0.15/5.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.58 % Starting sh5l with 300s (1) cores
% 0.15/5.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 969168 completed with status 0
% 0.15/5.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/5.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.58 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.15/5.58 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/5.58 % G-E--_302_C18_F1_URBAN_S0Y with pid 969176 completed with status 0
% 0.15/5.58 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.15/5.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/5.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.58 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.15/5.58 % Preprocessing time : 0.017 s
% 0.15/5.58
% 0.15/5.58 % Proof found!
% 0.15/5.58 % SZS status Theorem
% 0.15/5.58 % SZS output start CNFRefutation
% See solution above
% 0.15/5.58 % Parsed axioms : 117
% 0.15/5.58 % Removed by relevancy pruning/SinE : 0
% 0.15/5.58 % Initial clauses : 270
% 0.15/5.58 % Removed in clause preprocessing : 2
% 0.15/5.58 % Initial clauses in saturation : 268
% 0.15/5.58 % Processed clauses : 352
% 0.15/5.58 % ...of these trivial : 0
% 0.15/5.58 % ...subsumed : 3
% 0.15/5.58 % ...remaining for further processing : 349
% 0.15/5.58 % Other redundant clauses eliminated : 1094
% 0.15/5.58 % Clauses deleted for lack of memory : 0
% 0.15/5.58 % Backward-subsumed : 1
% 0.15/5.58 % Backward-rewritten : 11
% 0.15/5.58 % Generated clauses : 312
% 0.15/5.58 % ...of the previous two non-redundant : 317
% 0.15/5.58 % ...aggressively subsumed : 0
% 0.15/5.58 % Contextual simplify-reflections : 5
% 0.15/5.58 % Paramodulations : 68
% 0.15/5.58 % Factorizations : 0
% 0.15/5.58 % NegExts : 0
% 0.15/5.58 % Equation resolutions : 1103
% 0.15/5.58 % Disequality decompositions : 0
% 0.15/5.58 % Total rewrite steps : 64
% 0.15/5.58 % ...of those cached : 51
% 0.15/5.58 % Propositional unsat checks : 0
% 0.15/5.58 % Propositional check models : 0
% 0.15/5.58 % Propositional check unsatisfiable : 0
% 0.15/5.58 % Propositional clauses : 0
% 0.15/5.58 % Propositional clauses after purity: 0
% 0.15/5.58 % Propositional unsat core size : 0
% 0.15/5.58 % Propositional preprocessing time : 0.000
% 0.15/5.58 % Propositional encoding time : 0.000
% 0.15/5.58 % Propositional solver time : 0.000
% 0.15/5.58 % Success case prop preproc time : 0.000
% 0.15/5.58 % Success case prop encoding time : 0.000
% 0.15/5.58 % Success case prop solver time : 0.000
% 0.15/5.58 % Current number of processed clauses : 102
% 0.15/5.58 % Positive orientable unit clauses : 14
% 0.15/5.58 % Positive unorientable unit clauses: 0
% 0.15/5.58 % Negative unit clauses : 8
% 0.15/5.58 % Non-unit-clauses : 80
% 0.15/5.58 % Current number of unprocessed clauses: 233
% 0.15/5.58 % ...number of literals in the above : 2134
% 0.15/5.58 % Current number of archived formulas : 0
% 0.15/5.58 % Current number of archived clauses : 12
% 0.15/5.58 % Clause-clause subsumption calls (NU) : 31139
% 0.15/5.58 % Rec. Clause-clause subsumption calls : 1175
% 0.15/5.58 % Non-unit clause-clause subsumptions : 8
% 0.15/5.58 % Unit Clause-clause subsumption calls : 118
% 0.15/5.58 % Rewrite failures with RHS unbound : 0
% 0.15/5.58 % BW rewrite match attempts : 1
% 0.15/5.58 % BW rewrite match successes : 1
% 0.15/5.58 % Condensation attempts : 0
% 0.15/5.58 % Condensation successes : 0
% 0.15/5.58 % Termbank termtop insertions : 61833
% 0.15/5.58 % Search garbage collected termcells : 13857
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.113 s
% 0.15/5.58 % System time : 0.008 s
% 0.15/5.58 % Total time : 0.121 s
% 0.15/5.58 % Maximum resident set size: 5736 pages
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.425 s
% 0.15/5.58 % System time : 0.030 s
% 0.15/5.58 % Total time : 0.454 s
% 0.15/5.58 % Maximum resident set size: 5376 pages
% 0.15/5.58 % E exiting
%------------------------------------------------------------------------------