%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO523+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:23 PM UTC 2026
% Result : Theorem 0.25s 0.52s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 100 ( 64 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 94 ( 36 ~; 51 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 101 ( 0 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz10_4,conjecture,
! [X12,X15,X13,X37] :
( reflect(X12,X15,X37) = X13
| reflect(X12,X15,X13) != X37
| X12 = X15 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_4) ).
fof(aSatz7_18,axiom,
! [X12,X13,X15] :
( X12 = X15
| s(X12,X13) != s(X15,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_18) ).
fof(aSatz7_6,axiom,
! [X13,X12,X16] :
( X16 = s(X12,X13)
| ~ s_m(X13,X12,X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_6) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).
fof(aSatz8_22,axiom,
! [X12,X15] : s_m(X12,midpoint(X12,X15),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz8_22) ).
fof(aExtPerp4,axiom,
! [X12,X15,X13,X16] :
( perp(X12,X15,X16,X13)
| ~ perp(X12,X15,X13,X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aExtPerp4) ).
fof(aSatz10_2a,axiom,
! [X12,X15,X13] :
( ( perp(X12,X15,X13,reflect(X12,X15,X13))
| X13 = reflect(X12,X15,X13)
| X12 = X15 )
& ( s_col(X12,X15,midpoint(X13,reflect(X12,X15,X13)))
| X12 = X15 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_2a) ).
fof(aSatz10_2b,axiom,
! [X12,X15,X13,X37] :
( ( X37 = reflect(X12,X15,X13)
| X13 != X37
| ~ s_col(X12,X15,midpoint(X13,X37))
| X12 = X15 )
& ( X37 = reflect(X12,X15,X13)
| ~ perp(X12,X15,X13,X37)
| ~ s_col(X12,X15,midpoint(X13,X37))
| X12 = X15 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_2b) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X15,X13,X37] :
( reflect(X12,X15,X37) = X13
| reflect(X12,X15,X13) != X37
| X12 = X15 ),
inference(assume_negation,[status(cth)],[aSatz10_4]) ).
fof(c_0_9,plain,
! [X12,X13,X15] :
( X12 = X15
| s(X12,X13) != s(X15,X13) ),
inference(fof_simplification,[status(thm)],[aSatz7_18]) ).
fof(c_0_10,plain,
! [X13,X12,X16] :
( X16 = s(X12,X13)
| ~ s_m(X13,X12,X16) ),
inference(fof_simplification,[status(thm)],[aSatz7_6]) ).
fof(c_0_11,negated_conjecture,
~ ! [X12,X15,X13,X37] :
( reflect(X12,X15,X37) = X13
| reflect(X12,X15,X13) != X37
| X12 = X15 ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X452,X453,X454] :
( X452 = X454
| s(X452,X453) != s(X454,X453) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_13,plain,
! [X414,X415] : s(X414,s(X414,X415)) = X415,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
fof(c_0_14,plain,
! [X411,X412,X413] :
( X413 = s(X412,X411)
| ~ s_m(X411,X412,X413) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_15,plain,
! [X605,X606] : s_m(X605,midpoint(X605,X606),X606),
inference(variable_rename,[status(thm)],[aSatz8_22]) ).
fof(c_0_16,plain,
! [X12,X15,X13,X16] :
( perp(X12,X15,X16,X13)
| ~ perp(X12,X15,X13,X16) ),
inference(fof_simplification,[status(thm)],[aExtPerp4]) ).
fof(c_0_17,plain,
! [X805,X806,X807] :
( ( perp(X805,X806,X807,reflect(X805,X806,X807))
| X807 = reflect(X805,X806,X807)
| X805 = X806 )
& ( s_col(X805,X806,midpoint(X807,reflect(X805,X806,X807)))
| X805 = X806 ) ),
inference(variable_rename,[status(thm)],[aSatz10_2a]) ).
fof(c_0_18,negated_conjecture,
( reflect(esk1_0,esk2_0,esk4_0) != esk3_0
& reflect(esk1_0,esk2_0,esk3_0) = esk4_0
& esk1_0 != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_19,plain,
( s(X1,X2) != s(X3,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ s_m(X1,X2,X3)
| X3 = s(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
s_m(X1,midpoint(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X12,X15,X13,X37] :
( ( X37 = reflect(X12,X15,X13)
| X13 != X37
| ~ s_col(X12,X15,midpoint(X13,X37))
| X12 = X15 )
& ( X37 = reflect(X12,X15,X13)
| ~ perp(X12,X15,X13,X37)
| ~ s_col(X12,X15,midpoint(X13,X37))
| X12 = X15 ) ),
inference(fof_simplification,[status(thm)],[aSatz10_2b]) ).
fof(c_0_24,plain,
! [X648,X649,X650,X651] :
( perp(X648,X649,X651,X650)
| ~ perp(X648,X649,X650,X651) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_25,plain,
( perp(X1,X2,X3,reflect(X1,X2,X3))
| X3 = reflect(X1,X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
reflect(esk1_0,esk2_0,esk3_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( s(X1,s(X2,X3)) != X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
s(midpoint(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_30,plain,
! [X808,X809,X810,X811] :
( ( X811 = reflect(X808,X809,X810)
| X810 != X811
| ~ s_col(X808,X809,midpoint(X810,X811))
| X808 = X809 )
& ( X811 = reflect(X808,X809,X810)
| ~ perp(X808,X809,X810,X811)
| ~ s_col(X808,X809,midpoint(X810,X811))
| X808 = X809 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
cnf(c_0_31,plain,
( ~ perp(X1,X2,X3,X4)
| perp(X1,X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( perp(esk1_0,esk2_0,esk3_0,esk4_0)
| esk4_0 = esk3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
midpoint(s(X1,X2),X2) = X1,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_34,plain,
( s_col(X1,X2,midpoint(X3,reflect(X1,X2,X3)))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( ~ perp(X1,X2,X3,X4)
| ~ s_col(X1,X2,midpoint(X3,X4))
| X4 = reflect(X1,X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( perp(esk1_0,esk2_0,esk4_0,esk3_0)
| esk4_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
reflect(esk1_0,esk2_0,esk4_0) != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_38,plain,
midpoint(X1,X2) = midpoint(X2,X1),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
s_col(esk1_0,esk2_0,midpoint(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_27]) ).
cnf(c_0_40,negated_conjecture,
esk4_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_27]),c_0_38]),c_0_39])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_40]),c_0_26]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO523+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 17:09:49 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.25/0.52 % Version: 3.5.1
% 0.25/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.52 % Starting sh5l with 300s (1) cores
% 0.25/0.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 574418 completed with status 0
% 0.25/0.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.25/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.52 % No SInE strategy applied
% 0.25/0.52 % Search class: FGHSM-FSLF33-MFFFFFNN
% 0.25/0.52 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.25/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.52 % Starting new_bool_3 with 393s (1) cores
% 0.25/0.52 % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 0.25/0.52 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.25/0.52 % new_bool_3 with pid 574427 completed with status 0
% 0.25/0.52 % Result found by new_bool_3
% 0.25/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.52 % No SInE strategy applied
% 0.25/0.52 % Search class: FGHSM-FSLF33-MFFFFFNN
% 0.25/0.52 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.25/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.52 % Starting new_bool_3 with 393s (1) cores
% 0.25/0.52 % Preprocessing time : 0.006 s
% 0.25/0.52 % Presaturation interreduction done
% 0.25/0.52
% 0.25/0.52 % Proof found!
% 0.25/0.52 % SZS status Theorem
% 0.25/0.52 % SZS output start CNFRefutation
% See solution above
% 0.25/0.52 % Parsed axioms : 201
% 0.25/0.52 % Removed by relevancy pruning/SinE : 0
% 0.25/0.52 % Initial clauses : 294
% 0.25/0.52 % Removed in clause preprocessing : 1
% 0.25/0.52 % Initial clauses in saturation : 293
% 0.25/0.52 % Processed clauses : 657
% 0.25/0.52 % ...of these trivial : 21
% 0.25/0.52 % ...subsumed : 97
% 0.25/0.52 % ...remaining for further processing : 539
% 0.25/0.52 % Other redundant clauses eliminated : 38
% 0.25/0.52 % Clauses deleted for lack of memory : 0
% 0.25/0.52 % Backward-subsumed : 1
% 0.25/0.52 % Backward-rewritten : 23
% 0.25/0.52 % Generated clauses : 767
% 0.25/0.52 % ...of the previous two non-redundant : 534
% 0.25/0.52 % ...aggressively subsumed : 0
% 0.25/0.52 % Contextual simplify-reflections : 3
% 0.25/0.52 % Paramodulations : 724
% 0.25/0.52 % Factorizations : 2
% 0.25/0.52 % NegExts : 0
% 0.25/0.52 % Equation resolutions : 41
% 0.25/0.52 % Disequality decompositions : 0
% 0.25/0.52 % Total rewrite steps : 287
% 0.25/0.52 % ...of those cached : 222
% 0.25/0.52 % Propositional unsat checks : 0
% 0.25/0.52 % Propositional check models : 0
% 0.25/0.52 % Propositional check unsatisfiable : 0
% 0.25/0.52 % Propositional clauses : 0
% 0.25/0.52 % Propositional clauses after purity: 0
% 0.25/0.52 % Propositional unsat core size : 0
% 0.25/0.52 % Propositional preprocessing time : 0.000
% 0.25/0.52 % Propositional encoding time : 0.000
% 0.25/0.52 % Propositional solver time : 0.000
% 0.25/0.52 % Success case prop preproc time : 0.000
% 0.25/0.52 % Success case prop encoding time : 0.000
% 0.25/0.52 % Success case prop solver time : 0.000
% 0.25/0.52 % Current number of processed clauses : 231
% 0.25/0.52 % Positive orientable unit clauses : 36
% 0.25/0.52 % Positive unorientable unit clauses: 1
% 0.25/0.52 % Negative unit clauses : 13
% 0.25/0.52 % Non-unit-clauses : 181
% 0.25/0.52 % Current number of unprocessed clauses: 431
% 0.25/0.52 % ...number of literals in the above : 1185
% 0.25/0.52 % Current number of archived formulas : 0
% 0.25/0.52 % Current number of archived clauses : 292
% 0.25/0.52 % Clause-clause subsumption calls (NU) : 29794
% 0.25/0.52 % Rec. Clause-clause subsumption calls : 12016
% 0.25/0.52 % Non-unit clause-clause subsumptions : 95
% 0.25/0.52 % Unit Clause-clause subsumption calls : 130
% 0.25/0.52 % Rewrite failures with RHS unbound : 0
% 0.25/0.52 % BW rewrite match attempts : 139
% 0.25/0.52 % BW rewrite match successes : 14
% 0.25/0.52 % Condensation attempts : 0
% 0.25/0.52 % Condensation successes : 0
% 0.25/0.52 % Termbank termtop insertions : 36434
% 0.25/0.52 % Search garbage collected termcells : 2492
% 0.25/0.52
% 0.25/0.52 % -------------------------------------------------
% 0.25/0.52 % User time : 0.070 s
% 0.25/0.52 % System time : 0.005 s
% 0.25/0.52 % Total time : 0.075 s
% 0.25/0.52 % Maximum resident set size: 5292 pages
% 0.25/0.52
% 0.25/0.52 % -------------------------------------------------
% 0.25/0.52 % User time : 0.333 s
% 0.25/0.52 % System time : 0.031 s
% 0.25/0.52 % Total time : 0.364 s
% 0.25/0.52 % Maximum resident set size: 5120 pages
% 0.25/0.52 % E exiting
%------------------------------------------------------------------------------