%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR077+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:18:37 PM UTC 2026
% Result : Theorem 20.99s 4.21s
% Output : CNFRefutation 20.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 89 ( 34 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 110 ( 43 ~; 49 |; 13 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_3259,axiom,
! [X52,X53] :
( ( s__instance(X52,s__RealNumber)
& s__instance(X53,s__RealNumber)
& s__AbsoluteValueFn(X53) = X52 )
<=> ( ( X52 = minus("0",X53)
& s__instance(X53,s__NegativeRealNumber) )
| ( X53 = X52
& s__instance(X53,s__NonnegativeRealNumber) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3259) ).
fof(kb_SUMO_3424,axiom,
! [X12] :
( s__instance(X12,s__RealNumber)
=> ( s__instance(X12,s__NegativeRealNumber)
=> s__SignumFn(X12) = "-1" ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3424) ).
fof(prove_from_SUMO,conjecture,
~ s__instance(s__Number3_1,s__NegativeRealNumber),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_3422,axiom,
! [X12] :
( s__instance(X12,s__RealNumber)
=> ( s__instance(X12,s__NonnegativeRealNumber)
=> ( s__SignumFn(X12) = "0"
| s__SignumFn(X12) = "1" ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3422) ).
fof(local_1,axiom,
s__instance(s__Number3_1,s__NonnegativeRealNumber),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_5,plain,
! [X6175,X6176] :
( ( X6175 != minus("0",X6176)
| ~ s__instance(X6176,s__NegativeRealNumber)
| s__instance(X6175,s__RealNumber) )
& ( X6175 != minus("0",X6176)
| ~ s__instance(X6176,s__NegativeRealNumber)
| s__instance(X6176,s__RealNumber) )
& ( X6175 != minus("0",X6176)
| ~ s__instance(X6176,s__NegativeRealNumber)
| s__AbsoluteValueFn(X6176) = X6175 )
& ( X6176 != X6175
| ~ s__instance(X6176,s__NonnegativeRealNumber)
| s__instance(X6175,s__RealNumber) )
& ( X6176 != X6175
| ~ s__instance(X6176,s__NonnegativeRealNumber)
| s__instance(X6176,s__RealNumber) )
& ( X6176 != X6175
| ~ s__instance(X6176,s__NonnegativeRealNumber)
| s__AbsoluteValueFn(X6176) = X6175 )
& ( ~ s__instance(X6175,s__RealNumber)
| ~ s__instance(X6176,s__RealNumber)
| s__AbsoluteValueFn(X6176) != X6175
| X6176 = X6175
| X6175 = minus("0",X6176) )
& ( ~ s__instance(X6175,s__RealNumber)
| ~ s__instance(X6176,s__RealNumber)
| s__AbsoluteValueFn(X6176) != X6175
| X6176 = X6175
| s__instance(X6176,s__NegativeRealNumber) )
& ( ~ s__instance(X6175,s__RealNumber)
| ~ s__instance(X6176,s__RealNumber)
| s__AbsoluteValueFn(X6176) != X6175
| s__instance(X6176,s__NonnegativeRealNumber)
| X6175 = minus("0",X6176) )
& ( ~ s__instance(X6175,s__RealNumber)
| ~ s__instance(X6176,s__RealNumber)
| s__AbsoluteValueFn(X6176) != X6175
| s__instance(X6176,s__NonnegativeRealNumber)
| s__instance(X6176,s__NegativeRealNumber) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3259])])])]) ).
fof(c_0_6,plain,
! [X6393] :
( s__SignumFn(X6393) = "-1"
| ~ s__instance(X6393,s__NegativeRealNumber)
| ~ s__instance(X6393,s__RealNumber) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3424])])]) ).
cnf(c_0_7,plain,
( X2 != minus("0",X1)
| ~ s__instance(X1,s__NegativeRealNumber)
| s__instance(X1,s__RealNumber) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
~ ~ s__instance(s__Number3_1,s__NegativeRealNumber),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_9,plain,
! [X6391] :
( s__SignumFn(X6391) = "0"
| s__SignumFn(X6391) = "1"
| ~ s__instance(X6391,s__NonnegativeRealNumber)
| ~ s__instance(X6391,s__RealNumber) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3422])])]) ).
cnf(c_0_10,plain,
( X2 != X1
| ~ s__instance(X2,s__NonnegativeRealNumber)
| s__instance(X1,s__RealNumber) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ s__instance(X1,s__NegativeRealNumber)
| ~ s__instance(X1,s__RealNumber)
| s__SignumFn(X1) = "-1" ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ s__instance(X1,s__NegativeRealNumber)
| s__instance(X1,s__RealNumber) ),
inference(er,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
s__instance(s__Number3_1,s__NegativeRealNumber),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ s__instance(X1,s__NonnegativeRealNumber)
| ~ s__instance(X1,s__RealNumber)
| s__SignumFn(X1) = "0"
| s__SignumFn(X1) = "1" ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ s__instance(X1,s__NonnegativeRealNumber)
| s__instance(X1,s__RealNumber) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ s__instance(X1,s__NegativeRealNumber)
| s__SignumFn(X1) = "-1" ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
s__instance(s__Number3_1,s__NegativeRealNumber),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ s__instance(X1,s__NonnegativeRealNumber)
| s__SignumFn(X1) = "1"
| s__SignumFn(X1) = "0" ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
s__instance(s__Number3_1,s__NonnegativeRealNumber),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_20,negated_conjecture,
s__SignumFn(s__Number3_1) = "-1",
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
$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_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR077+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 14:43:28 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 20.99/4.21 % Version: 3.5.1
% 20.99/4.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 20.99/4.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.99/4.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 20.99/4.21 % Starting new_bool_3 with 300s (1) cores
% 20.99/4.21 % Starting new_bool_1 with 300s (1) cores
% 20.99/4.21 % Starting sh5l with 300s (1) cores
% 20.99/4.21 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2571451 completed with status 0
% 20.99/4.21 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 20.99/4.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 20.99/4.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.99/4.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 20.99/4.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 20.99/4.21 % No SInE strategy applied
% 20.99/4.21 % Search class: FGHSM-SMLM31-MFFFFFNN
% 20.99/4.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 20.99/4.21 % Starting SubtermCWHack with 136s (1) cores
% 20.99/4.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 20.99/4.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 20.99/4.21 % Starting new_bool_3 with 136s (1) cores
% 20.99/4.21 % Starting new_bool_1 with 136s (1) cores
% 20.99/4.21 % new_bool_3 with pid 2571463 completed with status 0
% 20.99/4.21 % Result found by new_bool_3
% 20.99/4.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 20.99/4.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.99/4.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 20.99/4.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 20.99/4.21 % No SInE strategy applied
% 20.99/4.21 % Search class: FGHSM-SMLM31-MFFFFFNN
% 20.99/4.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 20.99/4.21 % Starting SubtermCWHack with 136s (1) cores
% 20.99/4.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 20.99/4.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 20.99/4.21 % Starting new_bool_3 with 136s (1) cores
% 20.99/4.21 % Preprocessing time : 0.116 s
% 20.99/4.21 % Presaturation interreduction done
% 20.99/4.21
% 20.99/4.21 % Proof found!
% 20.99/4.21 % SZS status Theorem
% 20.99/4.21 % SZS output start CNFRefutation
% See solution above
% 20.99/4.21 % Parsed axioms : 7219
% 20.99/4.21 % Removed by relevancy pruning/SinE : 0
% 20.99/4.21 % Initial clauses : 8410
% 20.99/4.21 % Removed in clause preprocessing : 63
% 20.99/4.21 % Initial clauses in saturation : 8347
% 20.99/4.21 % Processed clauses : 19157
% 20.99/4.21 % ...of these trivial : 618
% 20.99/4.21 % ...subsumed : 2420
% 20.99/4.21 % ...remaining for further processing : 16119
% 20.99/4.21 % Other redundant clauses eliminated : 313
% 20.99/4.21 % Clauses deleted for lack of memory : 0
% 20.99/4.21 % Backward-subsumed : 5
% 20.99/4.21 % Backward-rewritten : 67
% 20.99/4.21 % Generated clauses : 26684
% 20.99/4.21 % ...of the previous two non-redundant : 23323
% 20.99/4.21 % ...aggressively subsumed : 0
% 20.99/4.21 % Contextual simplify-reflections : 665
% 20.99/4.21 % Paramodulations : 26385
% 20.99/4.21 % Factorizations : 0
% 20.99/4.21 % NegExts : 0
% 20.99/4.21 % Equation resolutions : 313
% 20.99/4.21 % Disequality decompositions : 0
% 20.99/4.21 % Total rewrite steps : 6413
% 20.99/4.21 % ...of those cached : 4848
% 20.99/4.21 % Propositional unsat checks : 4
% 20.99/4.21 % Propositional check models : 4
% 20.99/4.21 % Propositional check unsatisfiable : 0
% 20.99/4.21 % Propositional clauses : 0
% 20.99/4.21 % Propositional clauses after purity: 0
% 20.99/4.21 % Propositional unsat core size : 0
% 20.99/4.21 % Propositional preprocessing time : 0.000
% 20.99/4.21 % Propositional encoding time : 0.066
% 20.99/4.21 % Propositional solver time : 0.088
% 20.99/4.21 % Success case prop preproc time : 0.000
% 20.99/4.21 % Success case prop encoding time : 0.000
% 20.99/4.21 % Success case prop solver time : 0.000
% 20.99/4.21 % Current number of processed clauses : 7643
% 20.99/4.21 % Positive orientable unit clauses : 6679
% 20.99/4.21 % Positive unorientable unit clauses: 6
% 20.99/4.21 % Negative unit clauses : 87
% 20.99/4.21 % Non-unit-clauses : 871
% 20.99/4.21 % Current number of unprocessed clauses: 20408
% 20.99/4.21 % ...number of literals in the above : 49330
% 20.99/4.21 % Current number of archived formulas : 0
% 20.99/4.21 % Current number of archived clauses : 8221
% 20.99/4.21 % Clause-clause subsumption calls (NU) : 3097403
% 20.99/4.21 % Rec. Clause-clause subsumption calls : 640015
% 20.99/4.21 % Non-unit clause-clause subsumptions : 859
% 20.99/4.21 % Unit Clause-clause subsumption calls : 242742
% 20.99/4.21 % Rewrite failures with RHS unbound : 2
% 20.99/4.21 % BW rewrite match attempts : 20
% 20.99/4.21 % BW rewrite match successes : 20
% 20.99/4.21 % Condensation attempts : 0
% 20.99/4.21 % Condensation successes : 0
% 20.99/4.21 % Termbank termtop insertions : 872173
% 20.99/4.21 % Search garbage collected termcells : 89722
% 20.99/4.21
% 20.99/4.21 % -------------------------------------------------
% 20.99/4.21 % User time : 3.229 s
% 20.99/4.21 % System time : 0.183 s
% 20.99/4.21 % Total time : 3.412 s
% 20.99/4.21 % Maximum resident set size: 31740 pages
% 20.99/4.21
% 20.99/4.21 % -------------------------------------------------
% 20.99/4.21 % User time : 12.892 s
% 20.99/4.21 % System time : 0.678 s
% 20.99/4.21 % Total time : 13.570 s
% 20.99/4.21 % Maximum resident set size: 12288 pages
% 20.99/4.21 % E exiting
%------------------------------------------------------------------------------