%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV023-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n005.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:59 PM UTC 2026
% Result : Unsatisfiable 1.31s 1.73s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 22 unt; 6 nHn; 28 RR)
% Number of literals : 61 ( 28 equ; 25 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_7,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(axiom_4,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_4) ).
cnf(axiom_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_71,axiom,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_24,axiom,
( p_Empty(X1)
| int_level(X1) != n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
cnf(quest_1,negated_conjecture,
level(t_139) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_2,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_5,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_13,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
axiom_7 ).
cnf(c_0_14,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
axiom_4 ).
cnf(c_0_15,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
axiom_18 ).
cnf(c_0_16,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_17,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( plus(minus(X1,X2),X2) = X1
| def_10(X2,X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,axiom,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
axiom_71 ).
cnf(c_0_20,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_21,plain,
( X1 = n0
| plus(X1,n1) != n1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
plus(minus(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_24,axiom,
( p_Empty(X1)
| int_level(X1) != n0 ),
axiom_24 ).
cnf(c_0_25,plain,
( level(plus(X1,n1)) = minus(level(X1),n1)
| p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
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,negated_conjecture,
level(t_139) = n1,
quest_1 ).
cnf(c_0_27,plain,
minus(n1,n1) = n0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
p_Rd(t_139),
quest_3 ).
cnf(c_0_29,plain,
gt(n1,n0),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
~ p_Wr(t_139),
quest_2 ).
cnf(c_0_31,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_32,plain,
( p_Empty(X1)
| level(X1) != n0 ),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_33,negated_conjecture,
level(plus(t_139,n1)) = n0,
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_25,c_0_26]),c_0_27]),c_0_28]),c_0_29])]),c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
quest_5 ).
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.00/0.12 % Problem : HWV023-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n005.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 19:11:30 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.31/1.73 % Version : CSE_E---1.7
% 1.31/1.73 % Problem : theBenchmark.p
% 1.31/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.73 % SZS output start CNFRefutation
% See solution above
% 1.31/1.73 % Total time : 1.372s
%------------------------------------------------------------------------------