%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV028-2 : 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 : n004.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:25 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 16 unt; 4 nHn; 15 RR)
% Number of literals : 33 ( 6 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quest_2,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_12,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_12) ).
cnf(axiom_71,axiom,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_71) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_5) ).
cnf(quest_1,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(axiom_75,axiom,
p_LES_EQU_(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_75) ).
cnf(c_0_7,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_8,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = n0 ),
inference(fof_simplification,[status(thm)],[axiom_12]) ).
cnf(c_0_9,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
inference(fof_simplification,[status(thm)],[axiom_71]) ).
cnf(c_0_10,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
c_0_7 ).
cnf(c_0_11,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_12,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = n0 ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
quest_1 ).
cnf(c_0_14,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_15,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
c_0_9 ).
cnf(c_0_16,axiom,
p_LES_EQU_(X1,X1),
axiom_75 ).
cnf(c_0_17,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) = n0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
c_0_14 ).
cnf(c_0_20,plain,
( p_LES_EQU_(X2,X1)
| p_LES_EQU_(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ p_LES_EQU_(n0,fwork_DOTfifo_DOTrtl_DOTfifo__length_),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV028-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 20:49:05 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_3 with pid 1470042 completed with status 0
% 0.12/0.45 % Result found by new_bool_3
% 0.12/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGUSS-FFMF21-SFFFFFNN
% 0.12/0.45 % partial match(1): FGUSS-FFSF21-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 1470045 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGUSS-FFMF21-SFFFFFNN
% 0.12/0.45 % partial match(1): FGUSS-FFSF21-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 136
% 0.12/0.45 % Removed by relevancy pruning/SinE : 109
% 0.12/0.45 % Initial clauses : 27
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 27
% 0.12/0.45 % Processed clauses : 19
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 0
% 0.12/0.45 % ...remaining for further processing : 19
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 0
% 0.12/0.45 % Backward-rewritten : 2
% 0.12/0.45 % Generated clauses : 16
% 0.12/0.45 % ...of the previous two non-redundant : 6
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 14
% 0.12/0.45 % Factorizations : 2
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 5
% 0.12/0.45 % ...of those cached : 0
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 17
% 0.12/0.45 % Positive orientable unit clauses : 5
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 6
% 0.12/0.45 % Non-unit-clauses : 6
% 0.12/0.45 % Current number of unprocessed clauses: 13
% 0.12/0.45 % ...number of literals in the above : 49
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 2
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 3
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 3
% 0.12/0.45 % Non-unit clause-clause subsumptions : 0
% 0.12/0.45 % Unit Clause-clause subsumption calls : 3
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 2
% 0.12/0.45 % BW rewrite match successes : 2
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 2438
% 0.12/0.45 % Search garbage collected termcells : 518
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.005 s
% 0.12/0.45 % System time : 0.003 s
% 0.12/0.45 % Total time : 0.008 s
% 0.12/0.45 % Maximum resident set size: 4000 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.009 s
% 0.12/0.45 % System time : 0.009 s
% 0.12/0.45 % Total time : 0.017 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------