%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW219+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 03:11:45 PM UTC 2026
% Result : Theorem 1.73s 0.92s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 11 ( 1 sgn 6 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(conj_0,hypothesis,
! [X97] :
( ! [X10] : c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X97,X10)),v_r)
=> ( ! [X10] : c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X97,X10))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(X10)))))
=> v_thesis____ ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact__096EX_Af_O_AALL_Ax_O_Acmod_A_If_Ax_J_A_060_061_Ar_A_G_Acmod_A_Ipoly_Ap_A_If_Ax_J_J_A_060_A_N_As_A_L_A1_A_P_Areal_A_ISuc_Ax_J_096,axiom,
? [X7] :
! [X3] :
( c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X7,X3))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(X3)))))
& c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X7,X3)),v_r) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact__096EX_Af_O_AALL_Ax_O_Acmod_A_If_Ax_J_A_060_061_Ar_A_G_Acmod_A_Ipoly_Ap_A_If_Ax_J_J_A_060_A_N_As_A_L_A1_A_P_Areal_A_ISuc_Ax_J_096) ).
fof(c_0_3,negated_conjecture,
~ v_thesis____,
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_4,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,hypothesis,
! [X98] :
( v_thesis____
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X98,esk2_1(X98)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(esk2_1(X98))))))
| ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X98,esk1_1(X98))),v_r) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])])]) ).
fof(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_nnf,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
( ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X1,esk2_1(X1)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(esk2_1(X1))))))
| ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X1,esk1_1(X1))),v_r)
| v_thesis____ ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
~ v_thesis____,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X613] :
( c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(esk9_0,X613))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(X613)))))
& c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(esk9_0,X613)),v_r) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact__096EX_Af_O_AALL_Ax_O_Acmod_A_If_Ax_J_A_060_061_Ar_A_G_Acmod_A_Ipoly_Ap_A_If_Ax_J_J_A_060_A_N_As_A_L_A1_A_P_Areal_A_ISuc_Ax_J_096])]) ).
cnf(c_0_10,hypothesis,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(X1,esk1_1(X1))),v_r)
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(X1,esk2_1(X1)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(esk2_1(X1)))))) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),hAPP(esk9_0,X1))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(X1))))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(esk9_0,X1)),v_r),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW219+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 09:41:42 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.42 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.73/0.92 % Version: 3.5.1
% 1.73/0.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.73/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/0.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.73/0.92 % Starting new_bool_3 with 300s (1) cores
% 1.73/0.92 % Starting new_bool_1 with 300s (1) cores
% 1.73/0.92 % Starting sh5l with 300s (1) cores
% 1.73/0.92 % new_bool_3 with pid 2541950 completed with status 0
% 1.73/0.92 % Result found by new_bool_3
% 1.73/0.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.73/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/0.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.73/0.92 % Starting new_bool_3 with 300s (1) cores
% 1.73/0.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.73/0.92 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.73/0.92 % Search class: FGHSM-FSLM31-DFFFFFNN
% 1.73/0.92 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.73/0.92 % Starting SubtermCWHack with 28s (1) cores
% 1.73/0.92 % SubtermCWHack with pid 2541953 completed with status 0
% 1.73/0.92 % Result found by SubtermCWHack
% 1.73/0.92 % Preprocessing class: FMLMSMSMSSSNFFN.
% 1.73/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/0.92 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.73/0.92 % Starting new_bool_3 with 300s (1) cores
% 1.73/0.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.73/0.92 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.73/0.92 % Search class: FGHSM-FSLM31-DFFFFFNN
% 1.73/0.92 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.73/0.92 % Starting SubtermCWHack with 28s (1) cores
% 1.73/0.92 % Preprocessing time : 0.005 s
% 1.73/0.92
% 1.73/0.92 % Proof found!
% 1.73/0.92 % SZS status Theorem
% 1.73/0.92 % SZS output start CNFRefutation
% See solution above
% 1.73/0.92 % Parsed axioms : 1267
% 1.73/0.92 % Removed by relevancy pruning/SinE : 801
% 1.73/0.92 % Initial clauses : 655
% 1.73/0.92 % Removed in clause preprocessing : 14
% 1.73/0.92 % Initial clauses in saturation : 641
% 1.73/0.92 % Processed clauses : 5313
% 1.73/0.92 % ...of these trivial : 298
% 1.73/0.92 % ...subsumed : 3834
% 1.73/0.92 % ...remaining for further processing : 1181
% 1.73/0.92 % Other redundant clauses eliminated : 235
% 1.73/0.92 % Clauses deleted for lack of memory : 0
% 1.73/0.92 % Backward-subsumed : 19
% 1.73/0.92 % Backward-rewritten : 56
% 1.73/0.92 % Generated clauses : 29672
% 1.73/0.92 % ...of the previous two non-redundant : 23902
% 1.73/0.92 % ...aggressively subsumed : 0
% 1.73/0.92 % Contextual simplify-reflections : 3
% 1.73/0.92 % Paramodulations : 29415
% 1.73/0.92 % Factorizations : 18
% 1.73/0.92 % NegExts : 0
% 1.73/0.92 % Equation resolutions : 249
% 1.73/0.92 % Disequality decompositions : 0
% 1.73/0.92 % Total rewrite steps : 24460
% 1.73/0.92 % ...of those cached : 22285
% 1.73/0.92 % Propositional unsat checks : 0
% 1.73/0.92 % Propositional check models : 0
% 1.73/0.92 % Propositional check unsatisfiable : 0
% 1.73/0.92 % Propositional clauses : 0
% 1.73/0.92 % Propositional clauses after purity: 0
% 1.73/0.92 % Propositional unsat core size : 0
% 1.73/0.92 % Propositional preprocessing time : 0.000
% 1.73/0.92 % Propositional encoding time : 0.000
% 1.73/0.92 % Propositional solver time : 0.000
% 1.73/0.92 % Success case prop preproc time : 0.000
% 1.73/0.92 % Success case prop encoding time : 0.000
% 1.73/0.92 % Success case prop solver time : 0.000
% 1.73/0.92 % Current number of processed clauses : 1041
% 1.73/0.92 % Positive orientable unit clauses : 305
% 1.73/0.92 % Positive unorientable unit clauses: 11
% 1.73/0.92 % Negative unit clauses : 166
% 1.73/0.92 % Non-unit-clauses : 559
% 1.73/0.92 % Current number of unprocessed clauses: 18774
% 1.73/0.92 % ...number of literals in the above : 39028
% 1.73/0.92 % Current number of archived formulas : 0
% 1.73/0.92 % Current number of archived clauses : 75
% 1.73/0.92 % Clause-clause subsumption calls (NU) : 65138
% 1.73/0.92 % Rec. Clause-clause subsumption calls : 45203
% 1.73/0.92 % Non-unit clause-clause subsumptions : 1205
% 1.73/0.92 % Unit Clause-clause subsumption calls : 7806
% 1.73/0.92 % Rewrite failures with RHS unbound : 0
% 1.73/0.92 % BW rewrite match attempts : 4865
% 1.73/0.92 % BW rewrite match successes : 114
% 1.73/0.92 % Condensation attempts : 0
% 1.73/0.92 % Condensation successes : 0
% 1.73/0.92 % Termbank termtop insertions : 483339
% 1.73/0.92 % Search garbage collected termcells : 11948
% 1.73/0.92
% 1.73/0.92 % -------------------------------------------------
% 1.73/0.92 % User time : 0.406 s
% 1.73/0.92 % System time : 0.023 s
% 1.73/0.92 % Total time : 0.429 s
% 1.73/0.92 % Maximum resident set size: 6600 pages
% 1.73/0.92
% 1.73/0.92 % -------------------------------------------------
% 1.73/0.92 % User time : 0.445 s
% 1.73/0.92 % System time : 0.028 s
% 1.73/0.92 % Total time : 0.473 s
% 1.73/0.92 % Maximum resident set size: 6144 pages
% 1.73/0.92 % E exiting
%------------------------------------------------------------------------------