%------------------------------------------------------------------------------
% File : E---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 : n005.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:09 PM UTC 2026
% Result : Theorem 1.03s 0.62s
% Output : CNFRefutation 1.03s
% 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, 9)',axiom,
vd1353 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 9)') ).
fof('pred(383, 7)',axiom,
vd1352 != vd1353,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 7)') ).
fof('pred(383, 8)',axiom,
vd1352 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 8)') ).
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,
! [X892,X893,X894,X895,X896,X897] :
( ~ rless(vf(X892,X894),vf(X892,X893))
| vf(X892,X893) = vf(X892,X894)
| ~ rpoint(X897)
| X892 != X897
| ~ rpoint(X896)
| X893 != X896
| ~ rpoint(X895)
| X894 != X895
| X892 = X893
| X892 = X894
| X893 = X894
| vangle(X892,X893,X894) != vangle(X892,X894,X893) ),
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,
! [X880,X881,X882,X883,X884,X885] :
( rless(vf(X880,X882),vf(X880,X881))
| rless(vf(X880,X881),vf(X880,X882))
| vf(X880,X881) = vf(X880,X882)
| ~ rpoint(X885)
| X880 != X885
| ~ rpoint(X884)
| X881 != X884
| ~ rpoint(X883)
| X882 != X883
| X880 = X881
| X880 = X882
| X881 = X882
| vangle(X880,X881,X882) != vangle(X880,X882,X881) ),
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(esk8_0)
& vd1352 = esk8_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])]) ).
fof(c_0_17,plain,
( rpoint(esk7_0)
& vd1354 = esk7_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])]) ).
fof(c_0_18,plain,
( rpoint(esk9_0)
& vd1353 = esk9_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,
vd1353 != vd1354,
inference(fof_simplification,[status(thm)],['pred(383, 9)']) ).
fof(c_0_21,plain,
vd1352 != vd1353,
inference(fof_simplification,[status(thm)],['pred(383, 7)']) ).
fof(c_0_22,plain,
vd1352 != vd1354,
inference(fof_simplification,[status(thm)],['pred(383, 8)']) ).
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(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
vd1352 = esk8_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
rpoint(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
vd1354 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
rpoint(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
vd1353 = esk9_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,
vd1353 != 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,
vd1352 != 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,
vd1353 != 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,
vd1352 != 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.02 % Problem : GEO331+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 15:23:18 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 1.03/0.62 % Version: 3.5.1
% 1.03/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.62 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 % Starting new_bool_1 with 300s (1) cores
% 1.03/0.62 % Starting sh5l with 300s (1) cores
% 1.03/0.62 % new_bool_3 with pid 1292900 completed with status 0
% 1.03/0.62 % Result found by new_bool_3
% 1.03/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.62 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.62 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.03/0.62 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.62 % Starting SubtermCWHack with 28s (1) cores
% 1.03/0.62 % SubtermCWHack with pid 1292903 completed with status 0
% 1.03/0.62 % Result found by SubtermCWHack
% 1.03/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.62 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.62 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.03/0.62 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.62 % Starting SubtermCWHack with 28s (1) cores
% 1.03/0.62 % Preprocessing time : 0.003 s
% 1.03/0.62
% 1.03/0.62 % Proof found!
% 1.03/0.62 % SZS status Theorem
% 1.03/0.62 % SZS output start CNFRefutation
% See solution above
% 1.03/0.62 % Parsed axioms : 126
% 1.03/0.62 % Removed by relevancy pruning/SinE : 62
% 1.03/0.62 % Initial clauses : 147
% 1.03/0.62 % Removed in clause preprocessing : 2
% 1.03/0.62 % Initial clauses in saturation : 145
% 1.03/0.62 % Processed clauses : 1254
% 1.03/0.62 % ...of these trivial : 0
% 1.03/0.62 % ...subsumed : 746
% 1.03/0.62 % ...remaining for further processing : 508
% 1.03/0.62 % Other redundant clauses eliminated : 836
% 1.03/0.62 % Clauses deleted for lack of memory : 0
% 1.03/0.62 % Backward-subsumed : 20
% 1.03/0.62 % Backward-rewritten : 3
% 1.03/0.62 % Generated clauses : 4205
% 1.03/0.62 % ...of the previous two non-redundant : 4128
% 1.03/0.62 % ...aggressively subsumed : 0
% 1.03/0.62 % Contextual simplify-reflections : 175
% 1.03/0.62 % Paramodulations : 4070
% 1.03/0.62 % Factorizations : 0
% 1.03/0.62 % NegExts : 0
% 1.03/0.62 % Equation resolutions : 837
% 1.03/0.62 % Disequality decompositions : 0
% 1.03/0.62 % Total rewrite steps : 6
% 1.03/0.62 % ...of those cached : 0
% 1.03/0.62 % Propositional unsat checks : 0
% 1.03/0.62 % Propositional check models : 0
% 1.03/0.62 % Propositional check unsatisfiable : 0
% 1.03/0.62 % Propositional clauses : 0
% 1.03/0.62 % Propositional clauses after purity: 0
% 1.03/0.62 % Propositional unsat core size : 0
% 1.03/0.62 % Propositional preprocessing time : 0.000
% 1.03/0.62 % Propositional encoding time : 0.000
% 1.03/0.62 % Propositional solver time : 0.000
% 1.03/0.62 % Success case prop preproc time : 0.000
% 1.03/0.62 % Success case prop encoding time : 0.000
% 1.03/0.62 % Success case prop solver time : 0.000
% 1.03/0.62 % Current number of processed clauses : 351
% 1.03/0.62 % Positive orientable unit clauses : 7
% 1.03/0.62 % Positive unorientable unit clauses: 0
% 1.03/0.62 % Negative unit clauses : 4
% 1.03/0.62 % Non-unit-clauses : 340
% 1.03/0.62 % Current number of unprocessed clauses: 3007
% 1.03/0.62 % ...number of literals in the above : 34563
% 1.03/0.62 % Current number of archived formulas : 0
% 1.03/0.62 % Current number of archived clauses : 23
% 1.03/0.62 % Clause-clause subsumption calls (NU) : 139735
% 1.03/0.62 % Rec. Clause-clause subsumption calls : 12392
% 1.03/0.62 % Non-unit clause-clause subsumptions : 941
% 1.03/0.62 % Unit Clause-clause subsumption calls : 3
% 1.03/0.62 % Rewrite failures with RHS unbound : 0
% 1.03/0.62 % BW rewrite match attempts : 3
% 1.03/0.62 % BW rewrite match successes : 3
% 1.03/0.62 % Condensation attempts : 0
% 1.03/0.62 % Condensation successes : 0
% 1.03/0.62 % Termbank termtop insertions : 176824
% 1.03/0.62 % Search garbage collected termcells : 11006
% 1.03/0.62
% 1.03/0.62 % -------------------------------------------------
% 1.03/0.62 % User time : 0.170 s
% 1.03/0.62 % System time : 0.010 s
% 1.03/0.62 % Total time : 0.180 s
% 1.03/0.62 % Maximum resident set size: 5280 pages
% 1.03/0.62
% 1.03/0.62 % -------------------------------------------------
% 1.03/0.62 % User time : 0.180 s
% 1.03/0.62 % System time : 0.016 s
% 1.03/0.62 % Total time : 0.195 s
% 1.03/0.62 % Maximum resident set size: 5632 pages
% 1.03/0.62 % E exiting
%------------------------------------------------------------------------------