TSTP Solution File: HWV009-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV009-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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 : Thu Aug 31 01:59:59 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 29
% Syntax : Number of formulae : 39 ( 6 unt; 23 typ; 0 def)
% Number of atoms : 28 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 19 >; 8 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
n1: $i ).
tff(decl_23,type,
plus: ( $i * $i ) > $i ).
tff(decl_24,type,
n0: $i ).
tff(decl_25,type,
gt: ( $i * $i ) > $o ).
tff(decl_26,type,
minus: ( $i * $i ) > $i ).
tff(decl_27,type,
def_10: ( $i * $i ) > $o ).
tff(decl_28,type,
y_27: $i > $i ).
tff(decl_29,type,
level: $i > $i ).
tff(decl_30,type,
int_level: $i > $i ).
tff(decl_31,type,
fifo_length: $i ).
tff(decl_32,type,
p_Full: $i > $o ).
tff(decl_33,type,
p_Empty: $i > $o ).
tff(decl_34,type,
p_Reset: $i > $o ).
tff(decl_35,type,
wr_level: $i > $i ).
tff(decl_36,type,
rd_level: $i > $i ).
tff(decl_37,type,
p_Wr_error: $i > $o ).
tff(decl_38,type,
p_Rd_error: $i > $o ).
tff(decl_39,type,
p_Mem: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
p_Data_out: ( $i * $i ) > $o ).
tff(decl_41,type,
p_Wr: $i > $o ).
tff(decl_42,type,
p_Rd: $i > $o ).
tff(decl_43,type,
p_Data_in: ( $i * $i ) > $o ).
tff(decl_44,type,
t_139: $i ).
cnf(axiom_29,axiom,
( ~ p_Reset(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_29) ).
cnf(quest_2,negated_conjecture,
( p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1))
| level(plus(t_139,n1)) != n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_1,negated_conjecture,
p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
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_26,axiom,
( int_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_26) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(c_0_6,axiom,
( ~ p_Reset(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
axiom_29 ).
cnf(c_0_7,negated_conjecture,
( p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1))
| level(plus(t_139,n1)) != n0 ),
quest_2 ).
cnf(c_0_8,negated_conjecture,
p_Reset(t_139),
quest_1 ).
cnf(c_0_9,axiom,
( ~ p_Reset(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
axiom_30 ).
cnf(c_0_10,negated_conjecture,
( p_Rd_error(plus(t_139,n1))
| level(plus(t_139,n1)) != n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,axiom,
( int_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
axiom_26 ).
cnf(c_0_12,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_13,negated_conjecture,
level(plus(t_139,n1)) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
cnf(c_0_14,plain,
( level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV009-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 17:03:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.013000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.017000 s
%------------------------------------------------------------------------------