%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO504+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:22 PM UTC 2026
% Result : Theorem 0.07s 10.61s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 69 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 32 ~; 28 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz8_2,conjecture,
! [X12,X15,X14] :
( s_r(X14,X15,X12)
| ~ s_r(X12,X15,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_2) ).
fof(d_Defn8_1,axiom,
! [X12,X15,X14] :
( ( ~ s_e(X12,X14,X12,s(X15,X14))
| s_r(X12,X15,X14) )
& ( s_e(X12,X14,X12,s(X15,X14))
| ~ s_r(X12,X15,X14) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_Defn8_1) ).
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_2) ).
fof(aA2,axiom,
! [X1,X2,X3,X4,X5,X6] :
( s_e(X3,X4,X5,X6)
| ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA2) ).
fof(aSatz7_13,axiom,
! [X13,X16,X12] : s_e(X13,X16,s(X12,X13),s(X12,X16)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_13) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).
fof(aSatz2_14,axiom,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X17,X14)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_14) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X15,X14] :
( s_r(X14,X15,X12)
| ~ s_r(X12,X15,X14) ),
inference(assume_negation,[status(cth)],[aSatz8_2]) ).
fof(c_0_8,plain,
! [X12,X15,X14] :
( ( ~ s_e(X12,X14,X12,s(X15,X14))
| s_r(X12,X15,X14) )
& ( s_e(X12,X14,X12,s(X15,X14))
| ~ s_r(X12,X15,X14) ) ),
inference(fof_simplification,[status(thm)],[d_Defn8_1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X12,X15,X14] :
( s_r(X14,X15,X12)
| ~ s_r(X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_2]) ).
fof(c_0_11,plain,
! [X544,X545,X546] :
( ( ~ s_e(X544,X546,X544,s(X545,X546))
| s_r(X544,X545,X546) )
& ( s_e(X544,X546,X544,s(X545,X546))
| ~ s_r(X544,X545,X546) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_12,negated_conjecture,
( ~ s_r(esk3_0,esk2_0,esk1_0)
& s_r(esk1_0,esk2_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4,X5,X6] :
( s_e(X3,X4,X5,X6)
| ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[aA2]) ).
fof(c_0_14,plain,
! [X75,X76,X77,X78] :
( s_e(X77,X78,X75,X76)
| ~ s_e(X75,X76,X77,X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
cnf(c_0_15,plain,
( ~ s_r(X1,X2,X3)
| s_e(X1,X3,X1,s(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X45,X46,X47,X48,X49,X50] :
( s_e(X47,X48,X49,X50)
| ~ s_e(X45,X46,X49,X50)
| ~ s_e(X45,X46,X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
s_e(esk1_0,esk3_0,esk1_0,s(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X423,X424,X425] : s_e(X423,X424,s(X425,X423),s(X425,X424)),
inference(variable_rename,[status(thm)],[aSatz7_13]) ).
fof(c_0_21,plain,
! [X410,X411] : s(X410,s(X410,X411)) = X411,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
cnf(c_0_22,plain,
( ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4)
| s_e(X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
s_e(esk1_0,s(esk2_0,esk3_0),esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
s_e(X1,X2,s(X3,X1),s(X3,X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X17,X14)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_14]) ).
cnf(c_0_27,negated_conjecture,
( ~ s_e(esk1_0,s(esk2_0,esk3_0),X1,X2)
| s_e(X1,X2,esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
s_e(X1,s(X2,X3),s(X2,X1),X3),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X109,X110,X111,X112] :
( s_e(X110,X109,X112,X111)
| ~ s_e(X109,X110,X111,X112) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
s_e(s(esk2_0,esk1_0),esk3_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X2,X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
s_e(esk1_0,esk3_0,s(esk2_0,esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_33,plain,
( ~ s_e(X1,X3,X1,s(X2,X3))
| s_r(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
s_e(esk3_0,esk1_0,esk3_0,s(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ s_r(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO504+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/10.53 % Computer : n012.cluster.edu
% 0.04/10.53 % Model : x86_64 x86_64
% 0.04/10.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/10.53 % Memory : 8046.5625MB
% 0.04/10.53 % OS : Linux 6.8.0-71-generic
% 0.04/10.53 % CPULimit : 300
% 0.04/10.53 % WCLimit : 300
% 0.04/10.53 % DateTime : Sun Sep 20 17:00:22 UTC 2026
% 0.04/10.53 % CPUTime :
% 0.04/10.53 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/10.55 Running first-order theorem proving
% 0.04/10.55 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.07/10.61 % Version: 3.5.1
% 0.07/10.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/10.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/10.61 % Starting new_bool_3 with 300s (1) cores
% 0.07/10.61 % Starting new_bool_1 with 300s (1) cores
% 0.07/10.61 % Starting sh5l with 300s (1) cores
% 0.07/10.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 508239 completed with status 0
% 0.07/10.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.07/10.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/10.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/10.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/10.61 % No SInE strategy applied
% 0.07/10.61 % Search class: FGHSM-FSLF33-MFFFFFNN
% 0.07/10.61 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.07/10.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/10.61 % Starting SubtermCWHack with 136s (1) cores
% 0.07/10.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.07/10.61 % Starting new_bool_3 with 393s (1) cores
% 0.07/10.61 % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 0.07/10.61 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.07/10.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 508247 completed with status 0
% 0.07/10.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.07/10.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/10.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/10.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/10.61 % No SInE strategy applied
% 0.07/10.61 % Search class: FGHSM-FSLF33-MFFFFFNN
% 0.07/10.61 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 0.07/10.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/10.61 % Starting SubtermCWHack with 136s (1) cores
% 0.07/10.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.07/10.61 % Preprocessing time : 0.002 s
% 0.07/10.61 % Presaturation interreduction done
% 0.07/10.61
% 0.07/10.61 % Proof found!
% 0.07/10.61 % SZS status Theorem
% 0.07/10.61 % SZS output start CNFRefutation
% See solution above
% 0.07/10.61 % Parsed axioms : 131
% 0.07/10.61 % Removed by relevancy pruning/SinE : 0
% 0.07/10.61 % Initial clauses : 191
% 0.07/10.61 % Removed in clause preprocessing : 1
% 0.07/10.61 % Initial clauses in saturation : 190
% 0.07/10.61 % Processed clauses : 675
% 0.07/10.61 % ...of these trivial : 84
% 0.07/10.61 % ...subsumed : 51
% 0.07/10.61 % ...remaining for further processing : 540
% 0.07/10.61 % Other redundant clauses eliminated : 13
% 0.07/10.61 % Clauses deleted for lack of memory : 0
% 0.07/10.61 % Backward-subsumed : 1
% 0.07/10.61 % Backward-rewritten : 2
% 0.07/10.61 % Generated clauses : 2240
% 0.07/10.61 % ...of the previous two non-redundant : 1751
% 0.07/10.61 % ...aggressively subsumed : 0
% 0.07/10.61 % Contextual simplify-reflections : 2
% 0.07/10.61 % Paramodulations : 2222
% 0.07/10.61 % Factorizations : 2
% 0.07/10.61 % NegExts : 0
% 0.07/10.61 % Equation resolutions : 16
% 0.07/10.61 % Disequality decompositions : 0
% 0.07/10.61 % Total rewrite steps : 605
% 0.07/10.61 % ...of those cached : 425
% 0.07/10.61 % Propositional unsat checks : 0
% 0.07/10.61 % Propositional check models : 0
% 0.07/10.61 % Propositional check unsatisfiable : 0
% 0.07/10.61 % Propositional clauses : 0
% 0.07/10.61 % Propositional clauses after purity: 0
% 0.07/10.61 % Propositional unsat core size : 0
% 0.07/10.61 % Propositional preprocessing time : 0.000
% 0.07/10.61 % Propositional encoding time : 0.000
% 0.07/10.61 % Propositional solver time : 0.000
% 0.07/10.61 % Success case prop preproc time : 0.000
% 0.07/10.61 % Success case prop encoding time : 0.000
% 0.07/10.61 % Success case prop solver time : 0.000
% 0.07/10.61 % Current number of processed clauses : 350
% 0.07/10.61 % Positive orientable unit clauses : 111
% 0.07/10.61 % Positive unorientable unit clauses: 0
% 0.07/10.61 % Negative unit clauses : 12
% 0.07/10.61 % Non-unit-clauses : 227
% 0.07/10.61 % Current number of unprocessed clauses: 1432
% 0.07/10.61 % ...number of literals in the above : 4267
% 0.07/10.61 % Current number of archived formulas : 0
% 0.07/10.61 % Current number of archived clauses : 181
% 0.07/10.61 % Clause-clause subsumption calls (NU) : 15718
% 0.07/10.61 % Rec. Clause-clause subsumption calls : 7796
% 0.07/10.61 % Non-unit clause-clause subsumptions : 52
% 0.07/10.61 % Unit Clause-clause subsumption calls : 782
% 0.07/10.61 % Rewrite failures with RHS unbound : 0
% 0.07/10.61 % BW rewrite match attempts : 700
% 0.07/10.61 % BW rewrite match successes : 2
% 0.07/10.61 % Condensation attempts : 0
% 0.07/10.61 % Condensation successes : 0
% 0.07/10.61 % Termbank termtop insertions : 51947
% 0.07/10.61 % Search garbage collected termcells : 1391
% 0.07/10.61
% 0.07/10.61 % -------------------------------------------------
% 0.07/10.61 % User time : 0.043 s
% 0.07/10.61 % System time : 0.003 s
% 0.07/10.61 % Total time : 0.046 s
% 0.07/10.61 % Maximum resident set size: 4380 pages
% 0.07/10.61
% 0.07/10.61 % -------------------------------------------------
% 0.07/10.61 % User time : 0.140 s
% 0.07/10.61 % System time : 0.027 s
% 0.07/10.61 % Total time : 0.167 s
% 0.07/10.61 % Maximum resident set size: 4864 pages
% 0.07/10.61 % E exiting
%------------------------------------------------------------------------------