%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO277+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 : 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:29:59 PM UTC 2026
% Result : Theorem 0.34s 0.54s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 29 unt; 0 def)
% Number of atoms : 162 ( 73 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 188 ( 74 ~; 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,
! [X102,X103,X104,X105] :
( ( ? [X109] :
( rpoint(X109)
& X102 = X109 )
& ? [X108] :
( rpoint(X108)
& X103 = X108 )
& X102 != X103
& ? [X107] :
( rline(X107)
& X104 = X107 )
& ? [X106] :
( rline(X106)
& X105 = X106 )
& ron(X102,X104)
& ron(X102,X105)
& ron(X103,X104)
& ron(X103,X105) )
=> X104 = X105 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('qu(theu(the(230), 1), imp(the(230)))',conjecture,
! [X1] :
( ( rline(X1)
& ron(vd1089,X1)
& ron(vd1085,X1) )
=> X1 = vd1099 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(230), 1), imp(the(230)))') ).
fof('pred(226, 0)',axiom,
rpoint(vd1089),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(226, 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('qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))',axiom,
! [X92,X93] :
( ( ? [X95] :
( rpoint(X95)
& X92 = X95 )
& ? [X94] :
( rpoint(X94)
& X93 = X94 ) )
=> ( vf(X92,X93) = v0
<=> X92 = X93 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).
fof('qe(s1(plural(224)))',axiom,
? [X8] :
( rpoint(X8)
& vd1080 = X8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s1(plural(224)))') ).
fof('holds(conjunct1(225), 1087, 0)',axiom,
vd1085 != vd1080,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(225), 1087, 0)') ).
fof('and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))',axiom,
( rline(vd1099)
& ron(vd1089,vd1099)
& ron(vd1085,vd1099) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))') ).
fof('holds(226, 1090, 0)',axiom,
vf(vd1089,vd1085) = vf(vd1089,vd1080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(226, 1090, 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(c_0_11,plain,
! [X102,X103,X104,X105] :
( ( ? [X109] :
( rpoint(X109)
& X102 = X109 )
& ? [X108] :
( rpoint(X108)
& X103 = X108 )
& X102 != X103
& ? [X107] :
( rline(X107)
& X104 = X107 )
& ? [X106] :
( rline(X106)
& X105 = X106 )
& ron(X102,X104)
& ron(X102,X105)
& ron(X103,X104)
& ron(X103,X105) )
=> X104 = X105 ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))']) ).
fof(c_0_12,plain,
! [X845,X846,X847,X848,X849,X850,X851,X852] :
( X847 = X848
| ~ rpoint(X852)
| X845 != X852
| ~ rpoint(X851)
| X846 != X851
| X845 = X846
| ~ rline(X850)
| X847 != X850
| ~ rline(X849)
| X848 != X849
| ~ ron(X845,X847)
| ~ ron(X845,X848)
| ~ ron(X846,X847)
| ~ ron(X846,X848) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( rline(X1)
& ron(vd1089,X1)
& ron(vd1085,X1) )
=> X1 = vd1099 ),
inference(assume_negation,[status(cth)],['qu(theu(the(230), 1), imp(the(230)))']) ).
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_12]) ).
fof(c_0_15,negated_conjecture,
( esk1_0 != vd1099
& rline(esk1_0)
& ron(vd1089,esk1_0)
& ron(vd1085,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
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_14])])])]) ).
cnf(c_0_17,negated_conjecture,
ron(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
rpoint(vd1089),
inference(split_conjunct,[status(thm)],['pred(226, 0)']) ).
cnf(c_0_19,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
rpoint(vd1086),
inference(split_conjunct,[status(thm)],['pred(225, 1)']) ).
cnf(c_0_21,plain,
vd1085 = vd1086,
inference(split_conjunct,[status(thm)],['pred(225, 4)']) ).
cnf(c_0_22,negated_conjecture,
( ~ ron(X1,X2)
| ~ ron(X1,esk1_0)
| ~ ron(vd1089,X2)
| ~ rline(X2)
| ~ rpoint(X1)
| X2 = esk1_0
| X1 = vd1089 ),
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_23,negated_conjecture,
ron(vd1085,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X835,X836,X837,X838] :
( ( ~ rpoint(X838)
| X835 != X838
| ~ rpoint(X837)
| X836 != X837
| vf(X835,X836) = v0
| X835 != X836 )
& ( ~ rpoint(X838)
| X835 != X838
| ~ rpoint(X837)
| X836 != X837
| X835 = X836
| vf(X835,X836) != 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_26,plain,
( rpoint(esk4_0)
& vd1080 = esk4_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(224)))'])]) ).
fof(c_0_27,plain,
vd1085 != vd1080,
inference(fof_simplification,[status(thm)],['holds(conjunct1(225), 1087, 0)']) ).
cnf(c_0_28,negated_conjecture,
( ~ ron(vd1085,X1)
| ~ ron(vd1089,X1)
| ~ rline(X1)
| X1 = esk1_0
| vd1085 = vd1089 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
rline(vd1099),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))']) ).
cnf(c_0_30,plain,
ron(vd1089,vd1099),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))']) ).
cnf(c_0_31,plain,
ron(vd1085,vd1099),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))']) ).
cnf(c_0_32,negated_conjecture,
esk1_0 != vd1099,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) != v0
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
vd1080 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,plain,
vd1085 != vd1080,
inference(fof_nnf,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| X1 != X2
| vf(X1,X2) = v0 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
vf(vd1089,vd1085) = vf(vd1089,vd1080),
inference(split_conjunct,[status(thm)],['holds(226, 1090, 0)']) ).
cnf(c_0_39,negated_conjecture,
vd1085 = vd1089,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_40,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| vf(X1,X2) != v0
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).
cnf(c_0_41,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
inference(split_conjunct,[status(thm)],['holds(226, 1090, 1)']) ).
cnf(c_0_42,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
vd1085 != vd1080,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
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_37])])]) ).
cnf(c_0_45,plain,
vf(vd1089,vd1089) = vf(vd1089,vd1080),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,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_40,c_0_41]),c_0_24]),c_0_42])]),c_0_43]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_18])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO277+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.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 15:06:09 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.34/0.54 % Version: 3.5.1
% 0.34/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.34/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.34/0.54 % Starting sh5l with 300s (1) cores
% 0.34/0.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3019483 completed with status 0
% 0.34/0.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.34/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.34/0.54 % No SInE strategy applied
% 0.34/0.54 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.34/0.54 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.34/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.34/0.54 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.34/0.54 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.34/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.34/0.54 % G-E--_302_C18_F1_URBAN_S0Y with pid 3019491 completed with status 0
% 0.34/0.54 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.34/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.34/0.54 % No SInE strategy applied
% 0.34/0.54 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.34/0.54 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.34/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.34/0.54 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.34/0.54 % Preprocessing time : 0.018 s
% 0.34/0.54
% 0.34/0.54 % Proof found!
% 0.34/0.54 % SZS status Theorem
% 0.34/0.54 % SZS output start CNFRefutation
% See solution above
% 0.34/0.54 % Parsed axioms : 127
% 0.34/0.54 % Removed by relevancy pruning/SinE : 0
% 0.34/0.54 % Initial clauses : 284
% 0.34/0.54 % Removed in clause preprocessing : 2
% 0.34/0.54 % Initial clauses in saturation : 282
% 0.34/0.54 % Processed clauses : 368
% 0.34/0.54 % ...of these trivial : 0
% 0.34/0.54 % ...subsumed : 2
% 0.34/0.54 % ...remaining for further processing : 366
% 0.34/0.54 % Other redundant clauses eliminated : 1094
% 0.34/0.54 % Clauses deleted for lack of memory : 0
% 0.34/0.54 % Backward-subsumed : 0
% 0.34/0.54 % Backward-rewritten : 9
% 0.34/0.54 % Generated clauses : 333
% 0.34/0.54 % ...of the previous two non-redundant : 332
% 0.34/0.54 % ...aggressively subsumed : 0
% 0.34/0.54 % Contextual simplify-reflections : 2
% 0.34/0.54 % Paramodulations : 89
% 0.34/0.54 % Factorizations : 0
% 0.34/0.54 % NegExts : 0
% 0.34/0.54 % Equation resolutions : 1103
% 0.34/0.54 % Disequality decompositions : 0
% 0.34/0.54 % Total rewrite steps : 107
% 0.34/0.54 % ...of those cached : 86
% 0.34/0.54 % Propositional unsat checks : 0
% 0.34/0.54 % Propositional check models : 0
% 0.34/0.54 % Propositional check unsatisfiable : 0
% 0.34/0.54 % Propositional clauses : 0
% 0.34/0.54 % Propositional clauses after purity: 0
% 0.34/0.54 % Propositional unsat core size : 0
% 0.34/0.54 % Propositional preprocessing time : 0.000
% 0.34/0.54 % Propositional encoding time : 0.000
% 0.34/0.54 % Propositional solver time : 0.000
% 0.34/0.54 % Success case prop preproc time : 0.000
% 0.34/0.54 % Success case prop encoding time : 0.000
% 0.34/0.54 % Success case prop solver time : 0.000
% 0.34/0.54 % Current number of processed clauses : 122
% 0.34/0.54 % Positive orientable unit clauses : 29
% 0.34/0.54 % Positive unorientable unit clauses: 0
% 0.34/0.54 % Negative unit clauses : 11
% 0.34/0.54 % Non-unit-clauses : 82
% 0.34/0.54 % Current number of unprocessed clauses: 245
% 0.34/0.54 % ...number of literals in the above : 2195
% 0.34/0.54 % Current number of archived formulas : 0
% 0.34/0.54 % Current number of archived clauses : 9
% 0.34/0.54 % Clause-clause subsumption calls (NU) : 28716
% 0.34/0.54 % Rec. Clause-clause subsumption calls : 766
% 0.34/0.54 % Non-unit clause-clause subsumptions : 3
% 0.34/0.54 % Unit Clause-clause subsumption calls : 452
% 0.34/0.54 % Rewrite failures with RHS unbound : 0
% 0.34/0.54 % BW rewrite match attempts : 1
% 0.34/0.54 % BW rewrite match successes : 1
% 0.34/0.54 % Condensation attempts : 0
% 0.34/0.54 % Condensation successes : 0
% 0.34/0.54 % Termbank termtop insertions : 62554
% 0.34/0.54 % Search garbage collected termcells : 13903
% 0.34/0.54
% 0.34/0.54 % -------------------------------------------------
% 0.34/0.54 % User time : 0.121 s
% 0.34/0.54 % System time : 0.006 s
% 0.34/0.54 % Total time : 0.127 s
% 0.34/0.54 % Maximum resident set size: 6208 pages
% 0.34/0.54
% 0.34/0.54 % -------------------------------------------------
% 0.34/0.54 % User time : 0.402 s
% 0.34/0.54 % System time : 0.025 s
% 0.34/0.54 % Total time : 0.427 s
% 0.34/0.54 % Maximum resident set size: 5376 pages
% 0.34/0.54 % E exiting
%------------------------------------------------------------------------------