%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO331+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 : 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:30:04 PM UTC 2026
% Result : Theorem 0.15s 5.85s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 29 unt; 0 def)
% Number of atoms : 158 ( 102 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 186 ( 73 ~; 63 |; 42 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn 24 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(385), 0), 2)',axiom,
! [X4,X5,X6] :
( ( ? [X9] :
( rpoint(X9)
& X4 = X9 )
& ? [X8] :
( rpoint(X8)
& X5 = X8 )
& ? [X7] :
( rpoint(X7)
& X6 = X7 )
& X4 != X5
& X4 != X6
& X5 != X6
& vangle(X4,X5,X6) = vangle(X4,X6,X5) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ~ rless(vf(X4,X6),vf(X4,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(385), 0), 2)') ).
fof('ass(cond(proof(385), 0), 0)',axiom,
! [X4,X5,X6] :
( ( ? [X9] :
( rpoint(X9)
& X4 = X9 )
& ? [X8] :
( rpoint(X8)
& X5 = X8 )
& ? [X7] :
( rpoint(X7)
& X6 = X7 )
& X4 != X5
& X4 != X6
& X5 != X6
& vangle(X4,X5,X6) = vangle(X4,X6,X5) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ( rless(vf(X4,X6),vf(X4,X5))
| rless(vf(X4,X5),vf(X4,X6)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(385), 0), 0)') ).
fof('holds(384, 1360, 0)',conjecture,
vf(vd1352,vd1353) = vf(vd1352,vd1354),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(384, 1360, 0)') ).
fof('qe(s1(plural(383)))',axiom,
? [X3] :
( rpoint(X3)
& vd1352 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s1(plural(383)))') ).
fof('qe(s3(plural(383)))',axiom,
? [X1] :
( rpoint(X1)
& vd1354 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(383)))') ).
fof('qe(s2(plural(383)))',axiom,
? [X2] :
( rpoint(X2)
& vd1353 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s2(plural(383)))') ).
fof('pred(383, 8)',axiom,
vd1352 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 8)') ).
fof('pred(383, 7)',axiom,
vd1352 != vd1353,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 7)') ).
fof('pred(383, 9)',axiom,
vd1353 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 9)') ).
fof('holds(383, 1356, 0)',axiom,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(383, 1356, 0)') ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ( ? [X9] :
( rpoint(X9)
& X4 = X9 )
& ? [X8] :
( rpoint(X8)
& X5 = X8 )
& ? [X7] :
( rpoint(X7)
& X6 = X7 )
& X4 != X5
& X4 != X6
& X5 != X6
& vangle(X4,X5,X6) = vangle(X4,X6,X5) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ~ rless(vf(X4,X6),vf(X4,X5)) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 2)']) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ( ? [X9] :
( rpoint(X9)
& X4 = X9 )
& ? [X8] :
( rpoint(X8)
& X5 = X8 )
& ? [X7] :
( rpoint(X7)
& X6 = X7 )
& X4 != X5
& X4 != X6
& X5 != X6
& vangle(X4,X5,X6) = vangle(X4,X6,X5) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ( rless(vf(X4,X6),vf(X4,X5))
| rless(vf(X4,X5),vf(X4,X6)) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 0)']) ).
fof(c_0_12,plain,
! [X792,X793,X794,X795,X796,X797] :
( ~ rless(vf(X792,X794),vf(X792,X793))
| vf(X792,X793) = vf(X792,X794)
| ~ rpoint(X797)
| X792 != X797
| ~ rpoint(X796)
| X793 != X796
| ~ rpoint(X795)
| X794 != X795
| X792 = X793
| X792 = X794
| X793 = X794
| vangle(X792,X793,X794) != vangle(X792,X794,X793) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(assume_negation,[status(cth)],['holds(384, 1360, 0)']) ).
fof(c_0_14,plain,
! [X780,X781,X782,X783,X784,X785] :
( rless(vf(X780,X782),vf(X780,X781))
| rless(vf(X780,X781),vf(X780,X782))
| vf(X780,X781) = vf(X780,X782)
| ~ rpoint(X785)
| X780 != X785
| ~ rpoint(X784)
| X781 != X784
| ~ rpoint(X783)
| X782 != X783
| X780 = X781
| X780 = X782
| X781 = X782
| vangle(X780,X781,X782) != vangle(X780,X782,X781) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_15,plain,
( ~ rless(vf(X1,X3),vf(X1,X2))
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rpoint(X4)
| X3 != X4
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| vf(X1,X2) = vf(X1,X3)
| X1 = X2
| X1 = X3
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
( rpoint(esk3_0)
& vd1352 = esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])]) ).
fof(c_0_17,plain,
( rpoint(esk1_0)
& vd1354 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])]) ).
fof(c_0_18,plain,
( rpoint(esk2_0)
& vd1353 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(383)))'])]) ).
fof(c_0_19,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
vd1352 != vd1354,
inference(fof_simplification,[status(thm)],['pred(383, 8)']) ).
fof(c_0_21,plain,
vd1352 != vd1353,
inference(fof_simplification,[status(thm)],['pred(383, 7)']) ).
fof(c_0_22,plain,
vd1353 != vd1354,
inference(fof_simplification,[status(thm)],['pred(383, 9)']) ).
cnf(c_0_23,plain,
( ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rpoint(X4)
| X3 != X4
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| rless(vf(X1,X3),vf(X1,X2))
| rless(vf(X1,X2),vf(X1,X3))
| vf(X1,X2) = vf(X1,X3)
| X1 = X2
| X1 = X3
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X1,X3),vf(X1,X2))
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X1 = X2
| X1 = X3
| X2 = X3
| vf(X1,X2) = vf(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])]) ).
cnf(c_0_25,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
vd1352 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
vd1354 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
vd1353 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_31,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
vd1352 != vd1354,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
vd1352 != vd1353,
inference(fof_nnf,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
vd1353 != vd1354,
inference(fof_nnf,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X1 = X2
| X1 = X3
| X2 = X3
| vf(X1,X2) = vf(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])])]),c_0_24]),c_0_24]) ).
cnf(c_0_36,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
inference(split_conjunct,[status(thm)],['holds(383, 1356, 0)']) ).
cnf(c_0_37,plain,
rpoint(vd1352),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,plain,
rpoint(vd1354),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,plain,
rpoint(vd1353),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
vd1352 != vd1354,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
vd1352 != vd1353,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
vd1353 != vd1354,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39])]),c_0_40]),c_0_41]),c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO331+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/5.59 % Computer : n019.cluster.edu
% 0.11/5.59 % Model : x86_64 x86_64
% 0.11/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59 % Memory : 8046.5625MB
% 0.11/5.59 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Sun Sep 20 15:23:43 UTC 2026
% 0.11/5.59 % CPUTime :
% 0.11/5.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.64 Running first-order theorem proving
% 0.15/5.64 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.15/5.85 % Version: 3.5.1
% 0.15/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.85 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.85 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.85 % Starting sh5l with 300s (1) cores
% 0.15/5.85 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 447687 completed with status 0
% 0.15/5.85 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.85 % No SInE strategy applied
% 0.15/5.85 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/5.85 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.85 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.15/5.85 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/5.85 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 447695 completed with status 0
% 0.15/5.85 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.85 % No SInE strategy applied
% 0.15/5.85 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/5.85 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.85 % Preprocessing time : 0.016 s
% 0.15/5.85 % Presaturation interreduction done
% 0.15/5.85
% 0.15/5.85 % Proof found!
% 0.15/5.85 % SZS status Theorem
% 0.15/5.85 % SZS output start CNFRefutation
% See solution above
% 0.15/5.85 % Parsed axioms : 126
% 0.15/5.85 % Removed by relevancy pruning/SinE : 0
% 0.15/5.85 % Initial clauses : 284
% 0.15/5.85 % Removed in clause preprocessing : 2
% 0.15/5.85 % Initial clauses in saturation : 282
% 0.15/5.85 % Processed clauses : 707
% 0.15/5.85 % ...of these trivial : 0
% 0.15/5.85 % ...subsumed : 3
% 0.15/5.85 % ...remaining for further processing : 704
% 0.15/5.85 % Other redundant clauses eliminated : 1214
% 0.15/5.85 % Clauses deleted for lack of memory : 0
% 0.15/5.85 % Backward-subsumed : 1
% 0.15/5.85 % Backward-rewritten : 0
% 0.15/5.85 % Generated clauses : 435
% 0.15/5.85 % ...of the previous two non-redundant : 418
% 0.15/5.85 % ...aggressively subsumed : 0
% 0.15/5.85 % Contextual simplify-reflections : 8
% 0.15/5.85 % Paramodulations : 165
% 0.15/5.85 % Factorizations : 2
% 0.15/5.85 % NegExts : 0
% 0.15/5.85 % Equation resolutions : 1217
% 0.15/5.85 % Disequality decompositions : 0
% 0.15/5.85 % Total rewrite steps : 17
% 0.15/5.85 % ...of those cached : 9
% 0.15/5.85 % Propositional unsat checks : 0
% 0.15/5.85 % Propositional check models : 0
% 0.15/5.85 % Propositional check unsatisfiable : 0
% 0.15/5.85 % Propositional clauses : 0
% 0.15/5.85 % Propositional clauses after purity: 0
% 0.15/5.85 % Propositional unsat core size : 0
% 0.15/5.85 % Propositional preprocessing time : 0.000
% 0.15/5.85 % Propositional encoding time : 0.000
% 0.15/5.85 % Propositional solver time : 0.000
% 0.15/5.85 % Success case prop preproc time : 0.000
% 0.15/5.85 % Success case prop encoding time : 0.000
% 0.15/5.85 % Success case prop solver time : 0.000
% 0.15/5.85 % Current number of processed clauses : 162
% 0.15/5.85 % Positive orientable unit clauses : 10
% 0.15/5.85 % Positive unorientable unit clauses: 0
% 0.15/5.85 % Negative unit clauses : 7
% 0.15/5.85 % Non-unit-clauses : 145
% 0.15/5.85 % Current number of unprocessed clauses: 271
% 0.15/5.85 % ...number of literals in the above : 2512
% 0.15/5.85 % Current number of archived formulas : 0
% 0.15/5.85 % Current number of archived clauses : 279
% 0.15/5.85 % Clause-clause subsumption calls (NU) : 70107
% 0.15/5.85 % Rec. Clause-clause subsumption calls : 2212
% 0.15/5.85 % Non-unit clause-clause subsumptions : 12
% 0.15/5.85 % Unit Clause-clause subsumption calls : 18
% 0.15/5.85 % Rewrite failures with RHS unbound : 0
% 0.15/5.85 % BW rewrite match attempts : 0
% 0.15/5.85 % BW rewrite match successes : 0
% 0.15/5.85 % Condensation attempts : 0
% 0.15/5.85 % Condensation successes : 0
% 0.15/5.85 % Termbank termtop insertions : 78853
% 0.15/5.85 % Search garbage collected termcells : 15701
% 0.15/5.85
% 0.15/5.85 % -------------------------------------------------
% 0.15/5.85 % User time : 0.180 s
% 0.15/5.85 % System time : 0.006 s
% 0.15/5.85 % Total time : 0.187 s
% 0.15/5.85 % Maximum resident set size: 6304 pages
% 0.15/5.85
% 0.15/5.85 % -------------------------------------------------
% 0.15/5.85 % User time : 0.596 s
% 0.15/5.85 % System time : 0.038 s
% 0.15/5.85 % Total time : 0.635 s
% 0.15/5.85 % Maximum resident set size: 5632 pages
% 0.15/5.85 % E exiting
%------------------------------------------------------------------------------