%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV021-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 : n020.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:58 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 9 unt; 5 nHn; 22 RR)
% Number of literals : 66 ( 8 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_52,axiom,
( p_Reset(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_52) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_70,axiom,
( p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_70) ).
cnf(axiom_30,axiom,
( ~ p_Reset(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_30) ).
cnf(axiom_24,axiom,
( p_Empty(X1)
| int_level(X1) != n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(quest_4,negated_conjecture,
~ p_Empty(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_2,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_1,negated_conjecture,
p_Rd_error(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(c_0_9,axiom,
( p_Reset(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1)) ),
axiom_52 ).
cnf(c_0_10,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_11,axiom,
( p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1)) ),
axiom_70 ).
cnf(c_0_12,plain,
( p_Reset(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ p_Rd_error(plus(X1,n1))
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( ~ p_Reset(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
axiom_30 ).
cnf(c_0_14,plain,
( p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ p_Rd_error(plus(X1,n1))
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,plain,
( ~ p_Rd(X1)
| ~ p_Wr(X1)
| ~ p_Rd_error(plus(X1,n1))
| ~ gt(level(X1),n0) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( p_Empty(X1)
| int_level(X1) != n0 ),
axiom_24 ).
cnf(c_0_17,plain,
( ~ p_Rd(X1)
| ~ p_Rd_error(plus(X1,n1))
| ~ gt(level(X1),n0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_18,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_19,plain,
( p_Empty(X1)
| level(X1) != n0 ),
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_20,plain,
( level(X1) = n0
| ~ p_Rd(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ p_Empty(t_139),
quest_4 ).
cnf(c_0_22,plain,
( p_Empty(X1)
| ~ p_Rd(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
p_Rd(t_139),
quest_2 ).
cnf(c_0_24,negated_conjecture,
p_Rd_error(plus(t_139,n1)),
quest_1 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV021-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % 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.14/0.32 % Computer : n020.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 19:11:50 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------