%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:47:23 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 24 unt; 8 nHn; 31 RR)
% Number of literals : 69 ( 26 equ; 31 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(axiom_7,axiom,
( X2 != X1
| ~ def_10(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(axiom_71,axiom,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(axiom_24,axiom,
( int_level(X1) != n0
| p_Empty(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(quest_2,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_1,negated_conjecture,
level(t_139) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_5,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_12,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
inference(fof_simplification,[status(thm)],[axiom_5]) ).
cnf(c_0_13,plain,
( X2 != X1
| ~ def_10(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_14,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_71]) ).
cnf(c_0_15,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
c_0_12 ).
cnf(c_0_16,plain,
( X2 != X1
| ~ def_10(X1,X2) ),
c_0_13 ).
cnf(c_0_17,plain,
( int_level(X1) != n0
| p_Empty(X1) ),
inference(fof_simplification,[status(thm)],[axiom_24]) ).
cnf(c_0_18,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_14 ).
cnf(c_0_19,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_20,plain,
( def_10(X2,plus(X1,X2))
| minus(plus(X1,X2),X2) = X1 ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_22,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_24,negated_conjecture,
~ p_Wr(t_139),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_25,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_26,plain,
( int_level(X1) != n0
| p_Empty(X1) ),
c_0_17 ).
cnf(c_0_27,plain,
( ~ gt(level(X1),n0)
| ~ p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = minus(level(X1),n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
level(t_139) = n1,
quest_1 ).
cnf(c_0_29,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
p_Rd(t_139),
quest_3 ).
cnf(c_0_31,plain,
gt(n1,n0),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
~ p_Wr(t_139),
c_0_24 ).
cnf(c_0_33,negated_conjecture,
~ p_Reset(t_139),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_35,plain,
( level(X1) != n0
| p_Empty(X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
level(plus(t_139,n1)) = n0,
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_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]),c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.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.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:51:16 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1693013 completed with status 0
% 0.14/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.47 % new_bool_1 with pid 1693021 completed with status 0
% 0.14/0.47 % Result found by new_bool_1
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.001 s
% 0.14/0.47 % Presaturation interreduction done
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 95
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 95
% 0.14/0.47 % Removed in clause preprocessing : 1
% 0.14/0.47 % Initial clauses in saturation : 94
% 0.14/0.47 % Processed clauses : 326
% 0.14/0.47 % ...of these trivial : 7
% 0.14/0.47 % ...subsumed : 70
% 0.14/0.47 % ...remaining for further processing : 249
% 0.14/0.47 % Other redundant clauses eliminated : 6
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 17
% 0.14/0.47 % Backward-rewritten : 4
% 0.14/0.47 % Generated clauses : 454
% 0.14/0.47 % ...of the previous two non-redundant : 346
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 61
% 0.14/0.47 % Paramodulations : 444
% 0.14/0.47 % Factorizations : 3
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 7
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 161
% 0.14/0.47 % ...of those cached : 117
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 149
% 0.14/0.47 % Positive orientable unit clauses : 26
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 7
% 0.14/0.47 % Non-unit-clauses : 116
% 0.14/0.47 % Current number of unprocessed clauses: 189
% 0.14/0.47 % ...number of literals in the above : 683
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 98
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 3023
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 757
% 0.14/0.47 % Non-unit clause-clause subsumptions : 143
% 0.14/0.47 % Unit Clause-clause subsumption calls : 72
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 20
% 0.14/0.47 % BW rewrite match successes : 2
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 12796
% 0.14/0.47 % Search garbage collected termcells : 192
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.015 s
% 0.14/0.47 % System time : 0.002 s
% 0.14/0.47 % Total time : 0.017 s
% 0.14/0.47 % Maximum resident set size: 3704 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.070 s
% 0.14/0.47 % System time : 0.016 s
% 0.14/0.47 % Total time : 0.086 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------