TSTP Solution File: HWV018-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV018-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 : n002.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:04 EDT 2023
% Result : Unsatisfiable 0.54s 0.80s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 35
% Syntax : Number of formulae : 57 ( 15 unt; 23 typ; 0 def)
% Number of atoms : 79 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 70 ( 25 ~; 45 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 20 ( 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_22,axiom,
( p_Full(X1)
| int_level(X1) != fifo_length ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_22) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_23,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).
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_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(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(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(quest_3,negated_conjecture,
p_Full(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
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(c_0_12,axiom,
( p_Full(X1)
| int_level(X1) != fifo_length ),
axiom_22 ).
cnf(c_0_13,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_14,axiom,
( int_level(X1) = fifo_length
| ~ p_Full(X1) ),
axiom_23 ).
cnf(c_0_15,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_16,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1) ),
axiom_82 ).
cnf(c_0_17,negated_conjecture,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
quest_5 ).
cnf(c_0_18,plain,
( p_Full(X1)
| level(X1) != fifo_length ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,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_20,plain,
( level(X1) = fifo_length
| ~ p_Full(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
p_Full(t_139),
quest_3 ).
cnf(c_0_22,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_15,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_23,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_16,c_0_13]),c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( level(plus(t_139,n1)) != fifo_length
| ~ p_Wr_error(plus(t_139,n1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,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_19,c_0_13]) ).
cnf(c_0_26,negated_conjecture,
level(t_139) = fifo_length,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
p_Wr(t_139),
quest_2 ).
cnf(c_0_28,negated_conjecture,
~ p_Rd(t_139),
quest_1 ).
cnf(c_0_29,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_30,axiom,
~ gt(X1,X1),
axiom_17 ).
cnf(c_0_31,plain,
( level(plus(X1,n1)) = level(X1)
| p_Rd(X1)
| p_Reset(X1)
| gt(fifo_length,level(X1)) ),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32]),c_0_28]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.28 % Problem : HWV018-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.29 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.54 % Computer : n002.cluster.edu
% 0.13/0.54 % Model : x86_64 x86_64
% 0.13/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.54 % Memory : 8042.1875MB
% 0.13/0.54 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.54 % CPULimit : 300
% 0.13/0.55 % WCLimit : 300
% 0.13/0.55 % DateTime : Tue Aug 29 17:23:50 EDT 2023
% 0.13/0.55 % CPUTime :
% 0.54/0.77 start to proof: theBenchmark
% 0.54/0.80 % Version : CSE_E---1.5
% 0.54/0.80 % Problem : theBenchmark.p
% 0.54/0.80 % Proof found
% 0.54/0.80 % SZS status Theorem for theBenchmark.p
% 0.54/0.80 % SZS output start Proof
% See solution above
% 0.54/0.80 % Total time : 0.019000 s
% 0.54/0.80 % SZS output end Proof
% 0.54/0.80 % Total time : 0.024000 s
%------------------------------------------------------------------------------