%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO271+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 : n012.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:03 PM UTC 2026
% Result : Theorem 0.07s 5.65s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 92 ( 31 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 114 ( 45 ~; 37 |; 29 &)
% ( 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 : 7 ( 7 usr; 6 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,
! [X136,X137,X138,X139,X140] :
( ( ? [X142] :
( rpoint(X142)
& X136 = X142 )
& ? [X141] :
( rpoint(X141)
& X137 = X141 )
& rcenter(X138,X139)
& rcenter(X138,X140)
& ron(X136,X139)
& ron(X137,X140)
& vf(X138,X136) = vf(X138,X137) )
=> X139 = X140 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(211), 1), imp(the(211)))',conjecture,
! [X1] :
( ( rcircle(X1)
& rcenter(vd1055,X1)
& ron(vd1057,X1) )
=> X1 = vd1061 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(211), 1), imp(the(211)))') ).
fof('and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))',axiom,
( rpoint(vd1056)
& vd1055 = vd1056
& rpoint(vd1058)
& vd1055 != vd1057
& vd1057 = vd1058 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))') ).
fof('and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))',axiom,
( rcircle(vd1061)
& rcenter(vd1055,vd1061)
& ron(vd1057,vd1061) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))') ).
fof(c_0_4,plain,
! [X863,X864,X865,X866,X867,X868,X869] :
( X866 = X867
| ~ rpoint(X869)
| X863 != X869
| ~ rpoint(X868)
| X864 != X868
| ~ rcenter(X865,X866)
| ~ rcenter(X865,X867)
| ~ ron(X863,X866)
| ~ ron(X864,X867)
| vf(X865,X863) != vf(X865,X864) ),
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(vd1055,X1)
& ron(vd1057,X1) )
=> X1 = vd1061 ),
inference(assume_negation,[status(cth)],['qu(theu(the(211), 1), imp(the(211)))']) ).
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 != vd1061
& rcircle(esk1_0)
& rcenter(vd1055,esk1_0)
& ron(vd1057,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(vd1055,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
( rpoint(vd1056)
& vd1055 = vd1056
& rpoint(vd1058)
& vd1055 != vd1057
& vd1057 = vd1058 ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).
cnf(c_0_11,negated_conjecture,
( ~ ron(X3,X1)
| ~ ron(X2,esk1_0)
| ~ rcenter(vd1055,X1)
| ~ rpoint(X3)
| ~ rpoint(X2)
| vf(vd1055,X2) != vf(vd1055,X3)
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rcenter(vd1055,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_13,negated_conjecture,
esk1_0 != vd1061,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
( rpoint(vd1056)
& vd1055 = vd1056
& rpoint(vd1058)
& vd1055 != vd1057
& vd1057 = vd1058 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ ron(X2,vd1061)
| ~ ron(X1,esk1_0)
| ~ rpoint(X2)
| ~ rpoint(X1)
| vf(vd1055,X1) != vf(vd1055,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
rpoint(vd1058),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
vd1057 = vd1058,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ ron(X1,vd1061)
| ~ ron(X1,esk1_0)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ron(vd1057,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
rpoint(vd1057),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
ron(vd1057,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO271+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.54 % Computer : n012.cluster.edu
% 0.04/5.54 % Model : x86_64 x86_64
% 0.04/5.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.54 % Memory : 8046.5625MB
% 0.04/5.54 % OS : Linux 6.8.0-71-generic
% 0.04/5.54 % CPULimit : 300
% 0.04/5.54 % WCLimit : 300
% 0.04/5.54 % DateTime : Sun Sep 20 14:59:01 UTC 2026
% 0.04/5.54 % CPUTime :
% 0.04/5.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.56 Running first-order theorem proving
% 0.04/5.56 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.07/5.65 % Version: 3.5.1
% 0.07/5.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/5.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/5.65 % Starting new_bool_3 with 300s (1) cores
% 0.07/5.65 % Starting new_bool_1 with 300s (1) cores
% 0.07/5.65 % Starting sh5l with 300s (1) cores
% 0.07/5.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 385975 completed with status 0
% 0.07/5.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.07/5.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/5.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/5.65 % No SInE strategy applied
% 0.07/5.65 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.07/5.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.07/5.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.07/5.65 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.07/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.07/5.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.07/5.65 % G-E--_302_C18_F1_URBAN_S0Y with pid 385983 completed with status 0
% 0.07/5.65 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.07/5.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/5.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/5.65 % No SInE strategy applied
% 0.07/5.65 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.07/5.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.07/5.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.07/5.65 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.07/5.65 % Preprocessing time : 0.010 s
% 0.07/5.65
% 0.07/5.65 % Proof found!
% 0.07/5.65 % SZS status Theorem
% 0.07/5.65 % SZS output start CNFRefutation
% See solution above
% 0.07/5.65 % Parsed axioms : 105
% 0.07/5.65 % Removed by relevancy pruning/SinE : 0
% 0.07/5.65 % Initial clauses : 260
% 0.07/5.65 % Removed in clause preprocessing : 2
% 0.07/5.65 % Initial clauses in saturation : 258
% 0.07/5.65 % Processed clauses : 475
% 0.07/5.65 % ...of these trivial : 0
% 0.07/5.65 % ...subsumed : 36
% 0.07/5.65 % ...remaining for further processing : 439
% 0.07/5.65 % Other redundant clauses eliminated : 1088
% 0.07/5.65 % Clauses deleted for lack of memory : 0
% 0.07/5.65 % Backward-subsumed : 1
% 0.07/5.65 % Backward-rewritten : 2
% 0.07/5.65 % Generated clauses : 576
% 0.07/5.65 % ...of the previous two non-redundant : 547
% 0.07/5.65 % ...aggressively subsumed : 0
% 0.07/5.65 % Contextual simplify-reflections : 26
% 0.07/5.65 % Paramodulations : 330
% 0.07/5.65 % Factorizations : 0
% 0.07/5.65 % NegExts : 0
% 0.07/5.65 % Equation resolutions : 1102
% 0.07/5.65 % Disequality decompositions : 0
% 0.07/5.65 % Total rewrite steps : 124
% 0.07/5.65 % ...of those cached : 112
% 0.07/5.65 % Propositional unsat checks : 0
% 0.07/5.65 % Propositional check models : 0
% 0.07/5.65 % Propositional check unsatisfiable : 0
% 0.07/5.65 % Propositional clauses : 0
% 0.07/5.65 % Propositional clauses after purity: 0
% 0.07/5.65 % Propositional unsat core size : 0
% 0.07/5.65 % Propositional preprocessing time : 0.000
% 0.07/5.65 % Propositional encoding time : 0.000
% 0.07/5.65 % Propositional solver time : 0.000
% 0.07/5.65 % Success case prop preproc time : 0.000
% 0.07/5.65 % Success case prop encoding time : 0.000
% 0.07/5.65 % Success case prop solver time : 0.000
% 0.07/5.65 % Current number of processed clauses : 204
% 0.07/5.65 % Positive orientable unit clauses : 17
% 0.07/5.65 % Positive unorientable unit clauses: 0
% 0.07/5.65 % Negative unit clauses : 7
% 0.07/5.65 % Non-unit-clauses : 180
% 0.07/5.65 % Current number of unprocessed clauses: 295
% 0.07/5.65 % ...number of literals in the above : 2965
% 0.07/5.65 % Current number of archived formulas : 0
% 0.07/5.65 % Current number of archived clauses : 3
% 0.07/5.65 % Clause-clause subsumption calls (NU) : 12352
% 0.07/5.65 % Rec. Clause-clause subsumption calls : 1058
% 0.07/5.65 % Non-unit clause-clause subsumptions : 58
% 0.07/5.65 % Unit Clause-clause subsumption calls : 173
% 0.07/5.65 % Rewrite failures with RHS unbound : 0
% 0.07/5.65 % BW rewrite match attempts : 2
% 0.07/5.65 % BW rewrite match successes : 2
% 0.07/5.65 % Condensation attempts : 0
% 0.07/5.65 % Condensation successes : 0
% 0.07/5.65 % Termbank termtop insertions : 67566
% 0.07/5.65 % Search garbage collected termcells : 13735
% 0.07/5.65
% 0.07/5.65 % -------------------------------------------------
% 0.07/5.65 % User time : 0.067 s
% 0.07/5.65 % System time : 0.009 s
% 0.07/5.65 % Total time : 0.076 s
% 0.07/5.65 % Maximum resident set size: 5728 pages
% 0.07/5.65
% 0.07/5.65 % -------------------------------------------------
% 0.07/5.65 % User time : 0.274 s
% 0.07/5.65 % System time : 0.031 s
% 0.07/5.65 % Total time : 0.305 s
% 0.07/5.65 % Maximum resident set size: 5376 pages
% 0.07/5.65 % E exiting
%------------------------------------------------------------------------------