TSTP Solution File: HWV026-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV026-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 : n031.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 02:00:09 EDT 2023
% Result : Unsatisfiable 0.55s 0.63s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 41 ( 7 unt; 23 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 19 >; 8 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 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_89,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Wr_error(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_89) ).
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_4,negated_conjecture,
( p_Wr_error(t_139)
| p_Wr_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_1,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
( ~ p_Wr_error(t_139)
| ~ p_Wr_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(axiom_90,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Wr_error(plus(X1,n1))
| ~ p_Wr_error(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_90) ).
cnf(quest_2,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(c_0_7,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Wr_error(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
axiom_89 ).
cnf(c_0_8,axiom,
( ~ p_Reset(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
axiom_29 ).
cnf(c_0_9,plain,
( p_Wr(X1)
| p_Wr_error(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( p_Wr_error(t_139)
| p_Wr_error(plus(t_139,n1)) ),
quest_4 ).
cnf(c_0_11,negated_conjecture,
~ p_Wr(t_139),
quest_1 ).
cnf(c_0_12,negated_conjecture,
( ~ p_Wr_error(t_139)
| ~ p_Wr_error(plus(t_139,n1)) ),
quest_3 ).
cnf(c_0_13,negated_conjecture,
p_Wr_error(t_139),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ p_Wr_error(plus(t_139,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_15,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Wr_error(plus(X1,n1))
| ~ p_Wr_error(X1) ),
axiom_90 ).
cnf(c_0_16,negated_conjecture,
~ p_Reset(t_139),
quest_2 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),c_0_11]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : HWV026-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.35 % Computer : n031.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 29 17:27:56 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.55/0.60 start to proof: theBenchmark
% 0.55/0.63 % Version : CSE_E---1.5
% 0.55/0.63 % Problem : theBenchmark.p
% 0.55/0.63 % Proof found
% 0.55/0.63 % SZS status Theorem for theBenchmark.p
% 0.55/0.63 % SZS output start Proof
% See solution above
% 0.55/0.63 % Total time : 0.015000 s
% 0.55/0.63 % SZS output end Proof
% 0.55/0.63 % Total time : 0.020000 s
%------------------------------------------------------------------------------