%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO278+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 : n009.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.14s 0.84s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 76 ( 21 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 99 ( 42 ~; 37 |; 17 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))',axiom,
! [X105,X106,X107,X108,X109] :
( ( ? [X111] :
( rpoint(X111)
& X105 = X111 )
& ? [X110] :
( rpoint(X110)
& X106 = X110 )
& rcenter(X107,X108)
& rcenter(X107,X109)
& ron(X105,X108)
& ron(X106,X109)
& vf(X107,X105) = vf(X107,X106) )
=> X108 = X109 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(231), 1), imp(the(231)))',conjecture,
! [X1] :
( ( rcircle(X1)
& rcenter(vd1089,X1)
& ron(vd1096,X1) )
=> X1 = vd1102 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(theu(the(231), 1), imp(the(231)))') ).
fof('and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))',axiom,
( rcircle(vd1102)
& rcenter(vd1089,vd1102)
& ron(vd1096,vd1102) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))') ).
fof('pred(229, 0)',axiom,
rpoint(vd1096),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(229, 0)') ).
fof(c_0_4,plain,
! [X849,X850,X851,X852,X853,X854,X855] :
( X852 = X853
| ~ rpoint(X855)
| X849 != X855
| ~ rpoint(X854)
| X850 != X854
| ~ rcenter(X851,X852)
| ~ rcenter(X851,X853)
| ~ ron(X849,X852)
| ~ ron(X850,X853)
| vf(X851,X849) != vf(X851,X850) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( rcircle(X1)
& rcenter(vd1089,X1)
& ron(vd1096,X1) )
=> X1 = vd1102 ),
inference(assume_negation,[status(cth)],['qu(theu(the(231), 1), imp(the(231)))']) ).
cnf(c_0_6,plain,
( ~ rpoint(X7)
| X2 != X7
| ~ rpoint(X6)
| X3 != X6
| ~ rcenter(X1,X5)
| ~ rcenter(X1,X4)
| ~ ron(X2,X5)
| ~ ron(X3,X4)
| vf(X1,X2) != vf(X1,X3)
| X5 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( esk1_0 != vd1102
& rcircle(esk1_0)
& rcenter(vd1089,esk1_0)
& ron(vd1096,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,plain,
( ~ ron(X4,X2)
| ~ ron(X5,X1)
| ~ rcenter(X3,X1)
| ~ rcenter(X3,X2)
| ~ rpoint(X5)
| ~ rpoint(X4)
| vf(X3,X4) != vf(X3,X5)
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
rcenter(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ ron(X3,X1)
| ~ ron(X2,esk1_0)
| ~ rcenter(vd1089,X1)
| ~ rpoint(X3)
| ~ rpoint(X2)
| vf(vd1089,X2) != vf(vd1089,X3)
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
rcenter(vd1089,vd1102),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))']) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != vd1102,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ ron(X2,vd1102)
| ~ ron(X1,esk1_0)
| ~ rpoint(X2)
| ~ rpoint(X1)
| vf(vd1089,X1) != vf(vd1089,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( ~ ron(X1,vd1102)
| ~ ron(X1,esk1_0)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
ron(vd1096,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
rpoint(vd1096),
inference(split_conjunct,[status(thm)],['pred(229, 0)']) ).
cnf(c_0_17,plain,
ron(vd1096,vd1102),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))']) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO278+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.11/0.58 % Computer : n009.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Sun Sep 20 15:17:28 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.63 Running first-order theorem proving
% 0.14/0.63 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/0.84 % Version: 3.5.1
% 0.14/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.84 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.84 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.84 % Starting sh5l with 300s (1) cores
% 0.14/0.84 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3713199 completed with status 0
% 0.14/0.84 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.84 % No SInE strategy applied
% 0.14/0.84 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.14/0.84 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.84 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.84 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.14/0.84 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.84 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.14/0.84 % G-E--_302_C18_F1_URBAN_S0Y with pid 3713205 completed with status 0
% 0.14/0.84 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.14/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.84 % No SInE strategy applied
% 0.14/0.84 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.14/0.84 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.84 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.84 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.14/0.84 % Preprocessing time : 0.018 s
% 0.14/0.84
% 0.14/0.84 % Proof found!
% 0.14/0.84 % SZS status Theorem
% 0.14/0.84 % SZS output start CNFRefutation
% See solution above
% 0.14/0.84 % Parsed axioms : 130
% 0.14/0.84 % Removed by relevancy pruning/SinE : 0
% 0.14/0.84 % Initial clauses : 289
% 0.14/0.84 % Removed in clause preprocessing : 2
% 0.14/0.84 % Initial clauses in saturation : 287
% 0.14/0.84 % Processed clauses : 704
% 0.14/0.84 % ...of these trivial : 6
% 0.14/0.84 % ...subsumed : 71
% 0.14/0.84 % ...remaining for further processing : 627
% 0.14/0.84 % Other redundant clauses eliminated : 1094
% 0.14/0.84 % Clauses deleted for lack of memory : 0
% 0.14/0.84 % Backward-subsumed : 8
% 0.14/0.84 % Backward-rewritten : 8
% 0.14/0.84 % Generated clauses : 1500
% 0.14/0.84 % ...of the previous two non-redundant : 1452
% 0.14/0.84 % ...aggressively subsumed : 0
% 0.14/0.84 % Contextual simplify-reflections : 26
% 0.14/0.84 % Paramodulations : 1251
% 0.14/0.84 % Factorizations : 0
% 0.14/0.84 % NegExts : 0
% 0.14/0.84 % Equation resolutions : 1108
% 0.14/0.84 % Disequality decompositions : 0
% 0.14/0.84 % Total rewrite steps : 784
% 0.14/0.84 % ...of those cached : 748
% 0.14/0.84 % Propositional unsat checks : 0
% 0.14/0.84 % Propositional check models : 0
% 0.14/0.84 % Propositional check unsatisfiable : 0
% 0.14/0.84 % Propositional clauses : 0
% 0.14/0.84 % Propositional clauses after purity: 0
% 0.14/0.84 % Propositional unsat core size : 0
% 0.14/0.84 % Propositional preprocessing time : 0.000
% 0.14/0.84 % Propositional encoding time : 0.000
% 0.14/0.84 % Propositional solver time : 0.000
% 0.14/0.84 % Success case prop preproc time : 0.000
% 0.14/0.84 % Success case prop encoding time : 0.000
% 0.14/0.84 % Success case prop solver time : 0.000
% 0.14/0.84 % Current number of processed clauses : 376
% 0.14/0.84 % Positive orientable unit clauses : 45
% 0.14/0.84 % Positive unorientable unit clauses: 0
% 0.14/0.84 % Negative unit clauses : 19
% 0.14/0.84 % Non-unit-clauses : 312
% 0.14/0.84 % Current number of unprocessed clauses: 1011
% 0.14/0.84 % ...number of literals in the above : 9906
% 0.14/0.84 % Current number of archived formulas : 0
% 0.14/0.84 % Current number of archived clauses : 16
% 0.14/0.84 % Clause-clause subsumption calls (NU) : 47515
% 0.14/0.84 % Rec. Clause-clause subsumption calls : 4414
% 0.14/0.84 % Non-unit clause-clause subsumptions : 66
% 0.14/0.84 % Unit Clause-clause subsumption calls : 764
% 0.14/0.84 % Rewrite failures with RHS unbound : 0
% 0.14/0.84 % BW rewrite match attempts : 3
% 0.14/0.84 % BW rewrite match successes : 3
% 0.14/0.84 % Condensation attempts : 0
% 0.14/0.84 % Condensation successes : 0
% 0.14/0.84 % Termbank termtop insertions : 93930
% 0.14/0.84 % Search garbage collected termcells : 13926
% 0.14/0.84
% 0.14/0.84 % -------------------------------------------------
% 0.14/0.84 % User time : 0.173 s
% 0.14/0.84 % System time : 0.010 s
% 0.14/0.84 % Total time : 0.183 s
% 0.14/0.84 % Maximum resident set size: 5956 pages
% 0.14/0.84
% 0.14/0.84 % -------------------------------------------------
% 0.14/0.84 % User time : 0.818 s
% 0.14/0.84 % System time : 0.036 s
% 0.14/0.84 % Total time : 0.854 s
% 0.14/0.84 % Maximum resident set size: 5376 pages
% 0.14/0.84 % E exiting
%------------------------------------------------------------------------------