%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV677-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 02:59:44 PM UTC 2026
% Result : Unsatisfiable 0.63s 1.04s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 7 unt; 8 nHn; 16 RR)
% Number of literals : 59 ( 26 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_nz_0,axiom,
( v_a != c_HOL_Ozero__class_Ozero(t_a)
| ~ class_Ring__and__Field_Ofield(t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_nz_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_lessequals(v_n,v_m,tc_nat)
| c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(v_a,c_HOL_Ominus__class_Ominus(v_m,v_n,tc_nat),t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_power__diff_0,axiom,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(X2,c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X3,X1),c_Power_Opower__class_Opower(X2,X4,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_power__diff_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Ofield(t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(cls_conjecture_0,negated_conjecture,
( c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(t_a),v_a,t_a),c_HOL_Ominus__class_Ominus(v_n,v_m,tc_nat),t_a)
| c_lessequals(v_n,v_m,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_inverse__eq__divide_0,axiom,
( ~ class_Ring__and__Field_Ofield(X1)
| c_HOL_Oinverse__class_Oinverse(X2,X1) = c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(X1),X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_inverse__eq__divide_0) ).
cnf(cls_power__diff__inverse_0,axiom,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Oinverse(X2,X1),c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X4,X1),c_Power_Opower__class_Opower(X2,X3,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_power__diff__inverse_0) ).
cnf(cls_nat__le__linear_0,axiom,
( c_lessequals(X2,X1,tc_nat)
| c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_nat__le__linear_0) ).
cnf(c_0_8,plain,
( v_a != c_HOL_Ozero__class_Ozero(t_a)
| ~ class_Ring__and__Field_Ofield(t_a) ),
inference(fof_simplification,[status(thm)],[cls_nz_0]) ).
cnf(c_0_9,negated_conjecture,
( ~ c_lessequals(v_n,v_m,tc_nat)
| c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(v_a,c_HOL_Ominus__class_Ominus(v_m,v_n,tc_nat),t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(X2,c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X3,X1),c_Power_Opower__class_Opower(X2,X4,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_power__diff_0]) ).
cnf(c_0_11,plain,
( v_a != c_HOL_Ozero__class_Ozero(t_a)
| ~ class_Ring__and__Field_Ofield(t_a) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
class_Ring__and__Field_Ofield(t_a),
tfree_tcs ).
cnf(c_0_13,negated_conjecture,
( c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(t_a),v_a,t_a),c_HOL_Ominus__class_Ominus(v_n,v_m,tc_nat),t_a)
| c_lessequals(v_n,v_m,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_14,plain,
( ~ class_Ring__and__Field_Ofield(X1)
| c_HOL_Oinverse__class_Oinverse(X2,X1) = c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(X1),X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_inverse__eq__divide_0]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_lessequals(v_n,v_m,tc_nat)
| c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(v_a,c_HOL_Ominus__class_Ominus(v_m,v_n,tc_nat),t_a) ),
c_0_9 ).
cnf(c_0_16,plain,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(X2,c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X3,X1),c_Power_Opower__class_Opower(X2,X4,X1),X1) ),
c_0_10 ).
cnf(c_0_17,plain,
c_HOL_Ozero__class_Ozero(t_a) != v_a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
( c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a) != c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(t_a),v_a,t_a),c_HOL_Ominus__class_Ominus(v_n,v_m,tc_nat),t_a)
| c_lessequals(v_n,v_m,tc_nat) ),
c_0_13 ).
cnf(c_0_19,plain,
( ~ class_Ring__and__Field_Ofield(X1)
| c_HOL_Oinverse__class_Oinverse(X2,X1) = c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(X1),X2,X1) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_nat),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Oinverse(X2,X1),c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X4,X1),c_Power_Opower__class_Opower(X2,X3,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_power__diff__inverse_0]) ).
cnf(c_0_22,negated_conjecture,
c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Oinverse(v_a,t_a),c_HOL_Ominus__class_Ominus(v_n,v_m,tc_nat),t_a) != c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(v_a,v_m,t_a),c_Power_Opower__class_Opower(v_a,v_n,t_a),t_a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12])]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ c_lessequals(X4,X3,tc_nat)
| ~ class_Ring__and__Field_Ofield(X1)
| X2 = c_HOL_Ozero__class_Ozero(X1)
| c_Power_Opower__class_Opower(c_HOL_Oinverse__class_Oinverse(X2,X1),c_HOL_Ominus__class_Ominus(X3,X4,tc_nat),X1) = c_HOL_Oinverse__class_Odivide(c_Power_Opower__class_Opower(X2,X4,X1),c_Power_Opower__class_Opower(X2,X3,X1),X1) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
~ c_lessequals(v_m,v_n,tc_nat),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]),c_0_17]) ).
cnf(c_0_25,axiom,
( c_lessequals(X2,X1,tc_nat)
| c_lessequals(X1,X2,tc_nat) ),
cls_nat__le__linear_0 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV677-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n018.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Mon Sep 21 09:20:28 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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
% 0.63/1.04 % Version: 3.5.1
% 0.63/1.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/1.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/1.04 % Starting new_bool_3 with 300s (1) cores
% 0.63/1.04 % Starting new_bool_1 with 300s (1) cores
% 0.63/1.04 % Starting sh5l with 300s (1) cores
% 0.63/1.04 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1539793 completed with status 0
% 0.63/1.04 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.63/1.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/1.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/1.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/1.04 % No SInE strategy applied
% 0.63/1.04 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.63/1.04 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/1.04 % Starting SubtermCWHack with 136s (1) cores
% 0.63/1.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.63/1.04 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.63/1.04 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.63/1.04 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.63/1.04 % G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 1539803 completed with status 0
% 0.63/1.04 % Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.63/1.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/1.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/1.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/1.04 % No SInE strategy applied
% 0.63/1.04 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.63/1.04 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/1.04 % Starting SubtermCWHack with 136s (1) cores
% 0.63/1.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.63/1.04 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 0.63/1.04 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.63/1.04 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.63/1.04 % Preprocessing time : 0.015 s
% 0.63/1.04 % Presaturation interreduction done
% 0.63/1.04
% 0.63/1.04 % Proof found!
% 0.63/1.04 % SZS status Unsatisfiable
% 0.63/1.04 % SZS output start CNFRefutation
% See solution above
% 0.63/1.04 % Parsed axioms : 684
% 0.63/1.04 % Removed by relevancy pruning/SinE : 0
% 0.63/1.04 % Initial clauses : 684
% 0.63/1.04 % Removed in clause preprocessing : 0
% 0.63/1.04 % Initial clauses in saturation : 684
% 0.63/1.04 % Processed clauses : 1259
% 0.63/1.04 % ...of these trivial : 27
% 0.63/1.04 % ...subsumed : 136
% 0.63/1.04 % ...remaining for further processing : 1096
% 0.63/1.04 % Other redundant clauses eliminated : 75
% 0.63/1.04 % Clauses deleted for lack of memory : 0
% 0.63/1.04 % Backward-subsumed : 1
% 0.63/1.04 % Backward-rewritten : 2
% 0.63/1.04 % Generated clauses : 8435
% 0.63/1.04 % ...of the previous two non-redundant : 7326
% 0.63/1.04 % ...aggressively subsumed : 0
% 0.63/1.04 % Contextual simplify-reflections : 1
% 0.63/1.04 % Paramodulations : 8351
% 0.63/1.04 % Factorizations : 4
% 0.63/1.04 % NegExts : 0
% 0.63/1.04 % Equation resolutions : 80
% 0.63/1.04 % Disequality decompositions : 0
% 0.63/1.04 % Total rewrite steps : 4368
% 0.63/1.04 % ...of those cached : 3876
% 0.63/1.04 % Propositional unsat checks : 0
% 0.63/1.04 % Propositional check models : 0
% 0.63/1.04 % Propositional check unsatisfiable : 0
% 0.63/1.04 % Propositional clauses : 0
% 0.63/1.04 % Propositional clauses after purity: 0
% 0.63/1.04 % Propositional unsat core size : 0
% 0.63/1.04 % Propositional preprocessing time : 0.000
% 0.63/1.04 % Propositional encoding time : 0.000
% 0.63/1.04 % Propositional solver time : 0.000
% 0.63/1.04 % Success case prop preproc time : 0.000
% 0.63/1.04 % Success case prop encoding time : 0.000
% 0.63/1.04 % Success case prop solver time : 0.000
% 0.63/1.04 % Current number of processed clauses : 552
% 0.63/1.04 % Positive orientable unit clauses : 69
% 0.63/1.04 % Positive unorientable unit clauses: 4
% 0.63/1.04 % Negative unit clauses : 14
% 0.63/1.04 % Non-unit-clauses : 465
% 0.63/1.04 % Current number of unprocessed clauses: 7291
% 0.63/1.04 % ...number of literals in the above : 26383
% 0.63/1.04 % Current number of archived formulas : 0
% 0.63/1.04 % Current number of archived clauses : 544
% 0.63/1.04 % Clause-clause subsumption calls (NU) : 73389
% 0.63/1.04 % Rec. Clause-clause subsumption calls : 31433
% 0.63/1.04 % Non-unit clause-clause subsumptions : 108
% 0.63/1.04 % Unit Clause-clause subsumption calls : 394
% 0.63/1.04 % Rewrite failures with RHS unbound : 0
% 0.63/1.04 % BW rewrite match attempts : 98
% 0.63/1.04 % BW rewrite match successes : 72
% 0.63/1.04 % Condensation attempts : 0
% 0.63/1.04 % Condensation successes : 0
% 0.63/1.04 % Termbank termtop insertions : 156737
% 0.63/1.04 % Search garbage collected termcells : 1320
% 0.63/1.04
% 0.63/1.04 % -------------------------------------------------
% 0.63/1.04 % User time : 0.423 s
% 0.63/1.04 % System time : 0.020 s
% 0.63/1.04 % Total time : 0.443 s
% 0.63/1.04 % Maximum resident set size: 4844 pages
% 0.63/1.04
% 0.63/1.04 % -------------------------------------------------
% 0.63/1.04 % User time : 1.908 s
% 0.63/1.04 % System time : 0.100 s
% 0.63/1.04 % Total time : 2.009 s
% 0.63/1.04 % Maximum resident set size: 5376 pages
% 0.63/1.04 % E exiting
%------------------------------------------------------------------------------