%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV016-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 : n016.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:21 PM UTC 2026
% Result : Unsatisfiable 0.54s 0.60s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 53 ( 24 unt; 24 nHn; 42 RR)
% Number of literals : 143 ( 41 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_44,axiom,
( ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(fifo_length,int_level(X1))
| p_Rd(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_44) ).
cnf(axiom_25,axiom,
( ~ p_Empty(X1)
| int_level(X1) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_25) ).
cnf(axiom_53,axiom,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_53) ).
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(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_82,axiom,
( int_level(plus(X1,n1)) = int_level(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_82) ).
cnf(quest_4,negated_conjecture,
p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_15,axiom,
( gt(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(quest_3,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(axiom_59,axiom,
( ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| gt(int_level(X1),n0)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_59) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(quest_2,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(quest_5,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_15,plain,
( ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(fifo_length,int_level(X1))
| p_Rd(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_44]) ).
cnf(c_0_16,plain,
( ~ p_Empty(X1)
| int_level(X1) = n0 ),
inference(fof_simplification,[status(thm)],[axiom_25]) ).
cnf(c_0_17,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_53]) ).
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,
( ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(fifo_length,int_level(X1))
| p_Rd(X1)
| p_Reset(X1) ),
c_0_15 ).
cnf(c_0_20,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_21,axiom,
( int_level(plus(X1,n1)) = int_level(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
axiom_82 ).
cnf(c_0_22,plain,
( ~ p_Empty(X1)
| int_level(X1) = n0 ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| p_Reset(X1) ),
c_0_17 ).
cnf(c_0_24,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_25,plain,
( ~ p_Wr(X1)
| gt(fifo_length,level(X1))
| p_Rd(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_26,plain,
( p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ p_Empty(X1)
| level(X1) = n0 ),
inference(rw,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
p_Empty(plus(t_139,n1)),
quest_4 ).
cnf(c_0_29,plain,
( ~ gt(level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_30,axiom,
( gt(X1,n0)
| X1 = n0 ),
axiom_15 ).
cnf(c_0_31,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_32,plain,
( ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| gt(int_level(X1),n0)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_59]) ).
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_24,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_34,plain,
( gt(fifo_length,level(X1))
| p_Reset(X1)
| p_Rd(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
plus(X1,n1) != n0,
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_36,negated_conjecture,
level(plus(t_139,n1)) = n0,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( ~ p_Wr(X1)
| ~ p_Rd(X1)
| p_Reset(X1)
| level(X1) = n0
| level(plus(X1,n1)) = level(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
p_Wr(t_139),
quest_2 ).
cnf(c_0_39,negated_conjecture,
~ p_Reset(t_139),
c_0_31 ).
cnf(c_0_40,plain,
( ~ p_Rd(X1)
| ~ p_Wr(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| gt(int_level(X1),n0)
| p_Reset(X1) ),
c_0_32 ).
cnf(c_0_41,plain,
( p_Reset(X1)
| p_Rd(X1)
| level(plus(X1,n1)) = level(X1)
| level(plus(X1,n1)) = plus(level(X1),n1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26]) ).
cnf(c_0_42,plain,
plus(X1,n1) != n0,
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( ~ p_Rd(t_139)
| level(t_139) = n0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_44,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_45,plain,
~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[axiom_17]) ).
cnf(c_0_46,plain,
( ~ p_Rd(X1)
| ~ p_Wr(X1)
| gt(level(X1),n0)
| 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_40,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_47,negated_conjecture,
level(t_139) = n0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_36]),c_0_42]),c_0_39]),c_0_43]) ).
cnf(c_0_48,plain,
n0 != n1,
inference(spm,[status(thm)],[c_0_42,c_0_44]) ).
cnf(c_0_49,plain,
~ gt(X1,X1),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
gt(fifo_length,n0),
quest_5 ).
cnf(c_0_51,negated_conjecture,
~ p_Rd(t_139),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36]),c_0_44]),c_0_38])]),c_0_48]),c_0_39]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_47]),c_0_36]),c_0_44]),c_0_38]),c_0_50])]),c_0_48]),c_0_39]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV016-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.35 % Computer : n016.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 20 20:53:22 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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
% 0.54/0.60 % Version: 3.5.1
% 0.54/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.60 % Starting sh5l with 300s (1) cores
% 0.54/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 789529 completed with status 0
% 0.54/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.54/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.60 % No SInE strategy applied
% 0.54/0.60 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.54/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.54/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.54/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.54/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 789536 completed with status 0
% 0.54/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.54/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.60 % No SInE strategy applied
% 0.54/0.60 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.54/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.54/0.60 % Preprocessing time : 0.002 s
% 0.54/0.60 % Presaturation interreduction done
% 0.54/0.60
% 0.54/0.60 % Proof found!
% 0.54/0.60 % SZS status Unsatisfiable
% 0.54/0.60 % SZS output start CNFRefutation
% See solution above
% 0.54/0.60 % Parsed axioms : 95
% 0.54/0.60 % Removed by relevancy pruning/SinE : 0
% 0.54/0.60 % Initial clauses : 95
% 0.54/0.60 % Removed in clause preprocessing : 1
% 0.54/0.60 % Initial clauses in saturation : 94
% 0.54/0.60 % Processed clauses : 1356
% 0.54/0.60 % ...of these trivial : 13
% 0.54/0.60 % ...subsumed : 734
% 0.54/0.60 % ...remaining for further processing : 608
% 0.54/0.60 % Other redundant clauses eliminated : 12
% 0.54/0.60 % Clauses deleted for lack of memory : 0
% 0.54/0.60 % Backward-subsumed : 54
% 0.54/0.60 % Backward-rewritten : 13
% 0.54/0.60 % Generated clauses : 5389
% 0.54/0.60 % ...of the previous two non-redundant : 3792
% 0.54/0.60 % ...aggressively subsumed : 0
% 0.54/0.60 % Contextual simplify-reflections : 76
% 0.54/0.60 % Paramodulations : 5369
% 0.54/0.60 % Factorizations : 7
% 0.54/0.60 % NegExts : 0
% 0.54/0.60 % Equation resolutions : 13
% 0.54/0.60 % Disequality decompositions : 0
% 0.54/0.60 % Total rewrite steps : 2726
% 0.54/0.60 % ...of those cached : 2591
% 0.54/0.60 % Propositional unsat checks : 0
% 0.54/0.60 % Propositional check models : 0
% 0.54/0.60 % Propositional check unsatisfiable : 0
% 0.54/0.60 % Propositional clauses : 0
% 0.54/0.60 % Propositional clauses after purity: 0
% 0.54/0.60 % Propositional unsat core size : 0
% 0.54/0.60 % Propositional preprocessing time : 0.000
% 0.54/0.60 % Propositional encoding time : 0.000
% 0.54/0.60 % Propositional solver time : 0.000
% 0.54/0.60 % Success case prop preproc time : 0.000
% 0.54/0.60 % Success case prop encoding time : 0.000
% 0.54/0.60 % Success case prop solver time : 0.000
% 0.54/0.60 % Current number of processed clauses : 462
% 0.54/0.60 % Positive orientable unit clauses : 47
% 0.54/0.60 % Positive unorientable unit clauses: 0
% 0.54/0.60 % Negative unit clauses : 7
% 0.54/0.60 % Non-unit-clauses : 408
% 0.54/0.60 % Current number of unprocessed clauses: 2558
% 0.54/0.60 % ...number of literals in the above : 11684
% 0.54/0.60 % Current number of archived formulas : 0
% 0.54/0.60 % Current number of archived clauses : 144
% 0.54/0.60 % Clause-clause subsumption calls (NU) : 28339
% 0.54/0.60 % Rec. Clause-clause subsumption calls : 7369
% 0.54/0.60 % Non-unit clause-clause subsumptions : 848
% 0.54/0.60 % Unit Clause-clause subsumption calls : 1415
% 0.54/0.60 % Rewrite failures with RHS unbound : 0
% 0.54/0.60 % BW rewrite match attempts : 200
% 0.54/0.60 % BW rewrite match successes : 13
% 0.54/0.60 % Condensation attempts : 0
% 0.54/0.60 % Condensation successes : 0
% 0.54/0.60 % Termbank termtop insertions : 106222
% 0.54/0.60 % Search garbage collected termcells : 190
% 0.54/0.60
% 0.54/0.60 % -------------------------------------------------
% 0.54/0.60 % User time : 0.090 s
% 0.54/0.60 % System time : 0.010 s
% 0.54/0.60 % Total time : 0.100 s
% 0.54/0.60 % Maximum resident set size: 3704 pages
% 0.54/0.60
% 0.54/0.60 % -------------------------------------------------
% 0.54/0.60 % User time : 0.494 s
% 0.54/0.60 % System time : 0.038 s
% 0.54/0.60 % Total time : 0.532 s
% 0.54/0.60 % Maximum resident set size: 4864 pages
% 0.54/0.60 % E exiting
%------------------------------------------------------------------------------