%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV018-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:28:57 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.75s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 16 unt; 12 nHn; 30 RR)
% Number of literals : 84 ( 17 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_44,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Wr(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_44) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_82,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_82) ).
cnf(axiom_42,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| p_Wr_error(plus(X1,n1))
| ~ p_Wr(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_42) ).
cnf(axiom_23,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).
cnf(quest_2,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_1,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(quest_3,negated_conjecture,
p_Full(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(axiom_22,axiom,
( p_Full(X1)
| int_level(X1) != fifo_length ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_22) ).
cnf(quest_5,negated_conjecture,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_12,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| int_level(plus(X1,n1)) = int_level(X1)
| ~ p_Wr(X1) ),
axiom_44 ).
cnf(c_0_13,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_14,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
axiom_82 ).
cnf(c_0_15,axiom,
( p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,int_level(X1))
| p_Wr_error(plus(X1,n1))
| ~ p_Wr(X1) ),
axiom_42 ).
cnf(c_0_16,plain,
( level(plus(X1,n1)) = level(X1)
| p_Reset(X1)
| p_Rd(X1)
| gt(fifo_length,level(X1))
| ~ p_Wr(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
( level(plus(X1,n1)) = level(X1)
| p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_13]) ).
cnf(c_0_18,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
axiom_23 ).
cnf(c_0_19,plain,
( p_Reset(X1)
| p_Rd(X1)
| p_Wr_error(plus(X1,n1))
| gt(fifo_length,level(X1))
| ~ p_Wr(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
p_Wr(t_139),
quest_2 ).
cnf(c_0_21,negated_conjecture,
~ p_Rd(t_139),
quest_1 ).
cnf(c_0_22,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_23,plain,
( level(plus(X1,n1)) = level(X1)
| p_Rd(X1)
| p_Reset(X1)
| gt(fifo_length,level(X1)) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( level(X1) = fifo_length
| ~ p_Full(X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_25,axiom,
~ gt(X1,X1),
axiom_17 ).
cnf(c_0_26,negated_conjecture,
( p_Wr_error(plus(t_139,n1))
| gt(fifo_length,level(t_139)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
p_Full(t_139),
quest_3 ).
cnf(c_0_28,axiom,
( p_Full(X1)
| int_level(X1) != fifo_length ),
axiom_22 ).
cnf(c_0_29,plain,
( level(plus(X1,n1)) = fifo_length
| p_Rd(X1)
| p_Reset(X1)
| ~ p_Full(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
quest_5 ).
cnf(c_0_31,negated_conjecture,
p_Wr_error(plus(t_139,n1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27])]),c_0_25]) ).
cnf(c_0_32,plain,
( p_Full(X1)
| level(X1) != fifo_length ),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
level(plus(t_139,n1)) = fifo_length,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_21]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
~ p_Full(plus(t_139,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : HWV018-1 : TPTP v9.2.1. Released v2.5.0.
% 0.11/0.14 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.35 % Computer : n001.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Mon May 4 19:11:33 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.12/0.36 % start to proof: theBenchmark
% 1.32/1.75 % Version : CSE_E---1.7
% 1.32/1.75 % Problem : theBenchmark.p
% 1.32/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.75 % SZS output start CNFRefutation
% See solution above
% 1.32/1.75 % Total time : 1.370s
%------------------------------------------------------------------------------