%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HWV022-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 : n010.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:48:48 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 60 ( 26 unt; 13 nHn; 51 RR)
% Number of literals : 109 ( 39 equ; 46 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_18,axiom,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(axiom_8,axiom,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(axiom_35,axiom,
( ~ gt(fifo_length,int_level(X1))
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| p_Rd(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_35) ).
cnf(quest_1,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
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_Rd(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(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_15,axiom,
( gt(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(quest_5,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(quest_3,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(axiom_6,axiom,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_9,axiom,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(axiom_3,axiom,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(c_0_16,plain,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
cnf(c_0_17,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_18,plain,
( ~ gt(fifo_length,int_level(X1))
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| p_Rd(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_35]) ).
cnf(c_0_19,plain,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
quest_1 ).
cnf(c_0_21,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
c_0_17 ).
cnf(c_0_22,plain,
( ~ gt(fifo_length,int_level(X1))
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| p_Rd(X1)
| p_Reset(X1) ),
c_0_18 ).
cnf(c_0_23,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_24,negated_conjecture,
( plus(X1,n1) != fifo_length
| X1 = level(t_139) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_26,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_27,negated_conjecture,
~ p_Rd(t_139),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_28,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_29,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
inference(fof_simplification,[status(thm)],[axiom_5]) ).
cnf(c_0_30,negated_conjecture,
( ~ gt(level(t_139),X1)
| gt(fifo_length,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_31,axiom,
( gt(X1,n0)
| X1 = n0 ),
axiom_15 ).
cnf(c_0_32,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_33,plain,
( ~ gt(fifo_length,level(X1))
| ~ p_Wr(X1)
| p_Rd(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = plus(level(X1),n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( fifo_length != n1
| level(t_139) = n0 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
p_Wr(t_139),
quest_3 ).
cnf(c_0_36,negated_conjecture,
gt(fifo_length,n0),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
~ p_Rd(t_139),
c_0_27 ).
cnf(c_0_38,negated_conjecture,
~ p_Reset(t_139),
c_0_28 ).
cnf(c_0_39,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
c_0_29 ).
cnf(c_0_40,negated_conjecture,
( gt(fifo_length,n1)
| level(t_139) = n0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]) ).
cnf(c_0_41,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
c_0_32 ).
cnf(c_0_42,negated_conjecture,
( fifo_length != n1
| level(plus(t_139,n1)) = n1 ),
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_33,c_0_34]),c_0_25]),c_0_35]),c_0_36])]),c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
cnf(c_0_44,plain,
( def_10(X2,plus(X1,X2))
| minus(plus(X1,X2),X2) = X1 ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( gt(fifo_length,n1)
| fifo_length = n1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_40]),c_0_25]) ).
cnf(c_0_46,negated_conjecture,
fifo_length != n1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
cnf(c_0_48,plain,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_49,plain,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( def_10(n1,fifo_length)
| minus(fifo_length,n1) = level(t_139) ),
inference(spm,[status(thm)],[c_0_44,c_0_20]) ).
cnf(c_0_51,negated_conjecture,
gt(fifo_length,n1),
inference(sr,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
c_0_47 ).
cnf(c_0_53,plain,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
c_0_48 ).
cnf(c_0_54,negated_conjecture,
minus(fifo_length,n1) = level(t_139),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_55,negated_conjecture,
( ~ gt(plus(X1,n1),fifo_length)
| gt(X1,level(t_139)) ),
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
cnf(c_0_56,negated_conjecture,
( ~ gt(X1,level(t_139))
| gt(plus(X1,n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_57,negated_conjecture,
gt(fifo_length,level(t_139)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_36])]) ).
cnf(c_0_58,negated_conjecture,
~ gt(plus(fifo_length,n1),fifo_length),
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(spm,[status(thm)],[c_0_33,c_0_55]),c_0_20]),c_0_35])]),c_0_41]),c_0_37]),c_0_38]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV022-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:48:54 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3495621 completed with status 0
% 0.13/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3495629 completed with status 0
% 0.13/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.45 % Preprocessing time : 0.002 s
% 0.13/0.45 % Presaturation interreduction done
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 95
% 0.13/0.45 % Removed by relevancy pruning/SinE : 0
% 0.13/0.45 % Initial clauses : 95
% 0.13/0.45 % Removed in clause preprocessing : 1
% 0.13/0.45 % Initial clauses in saturation : 94
% 0.13/0.45 % Processed clauses : 357
% 0.13/0.45 % ...of these trivial : 3
% 0.13/0.45 % ...subsumed : 75
% 0.13/0.45 % ...remaining for further processing : 279
% 0.13/0.45 % Other redundant clauses eliminated : 7
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 33
% 0.13/0.45 % Backward-rewritten : 12
% 0.13/0.45 % Generated clauses : 480
% 0.13/0.45 % ...of the previous two non-redundant : 398
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 65
% 0.13/0.45 % Paramodulations : 469
% 0.13/0.45 % Factorizations : 2
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 8
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 124
% 0.13/0.45 % ...of those cached : 105
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 154
% 0.13/0.45 % Positive orientable unit clauses : 15
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 13
% 0.13/0.45 % Non-unit-clauses : 126
% 0.13/0.45 % Current number of unprocessed clauses: 195
% 0.13/0.45 % ...number of literals in the above : 818
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 123
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 3860
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 784
% 0.13/0.45 % Non-unit clause-clause subsumptions : 137
% 0.13/0.45 % Unit Clause-clause subsumption calls : 232
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 13
% 0.13/0.45 % BW rewrite match successes : 9
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 12005
% 0.13/0.45 % Search garbage collected termcells : 192
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.030 s
% 0.13/0.45 % System time : 0.004 s
% 0.13/0.45 % Total time : 0.034 s
% 0.13/0.45 % Maximum resident set size: 3704 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.134 s
% 0.13/0.45 % System time : 0.018 s
% 0.13/0.45 % Total time : 0.152 s
% 0.13/0.45 % Maximum resident set size: 4864 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------