TSTP Solution File: HWV022-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV022-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 02:00:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 39
% Syntax : Number of formulae : 73 ( 23 unt; 23 typ; 0 def)
% Number of atoms : 88 ( 33 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 72 ( 34 ~; 38 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 41 ( 2 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_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(quest_1,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_8,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(axiom_35,axiom,
( p_Reset(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| ~ p_Wr(X1)
| ~ gt(fifo_length,int_level(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_35) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(quest_3,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_2,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(quest_5,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(axiom_6,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_9,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(axiom_3,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(c_0_16,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
axiom_18 ).
cnf(c_0_17,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
quest_1 ).
cnf(c_0_18,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
axiom_8 ).
cnf(c_0_19,axiom,
( p_Reset(X1)
| p_Rd(X1)
| int_level(plus(X1,n1)) = plus(int_level(X1),n1)
| ~ p_Wr(X1)
| ~ gt(fifo_length,int_level(X1)) ),
axiom_35 ).
cnf(c_0_20,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_21,negated_conjecture,
( X1 = level(t_139)
| plus(X1,n1) != fifo_length ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_23,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_24,negated_conjecture,
( gt(fifo_length,plus(X1,n1))
| ~ gt(level(t_139),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_26,plain,
( level(plus(X1,n1)) = plus(level(X1),n1)
| p_Reset(X1)
| p_Rd(X1)
| ~ p_Wr(X1)
| ~ gt(fifo_length,level(X1)) ),
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_27,negated_conjecture,
( level(t_139) = n0
| fifo_length != n1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
p_Wr(t_139),
quest_3 ).
cnf(c_0_29,negated_conjecture,
gt(fifo_length,n0),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
~ p_Rd(t_139),
quest_2 ).
cnf(c_0_31,negated_conjecture,
~ p_Reset(t_139),
quest_4 ).
cnf(c_0_32,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
axiom_5 ).
cnf(c_0_33,negated_conjecture,
( level(t_139) = n0
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
quest_5 ).
cnf(c_0_35,negated_conjecture,
( level(plus(t_139,n1)) = n1
| fifo_length != n1 ),
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_26,c_0_27]),c_0_22]),c_0_28]),c_0_29])]),c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( fifo_length = n1
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_33]),c_0_22]) ).
cnf(c_0_38,negated_conjecture,
fifo_length != n1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
axiom_6 ).
cnf(c_0_40,negated_conjecture,
( minus(fifo_length,n1) = level(t_139)
| def_10(n1,fifo_length) ),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_41,negated_conjecture,
gt(fifo_length,n1),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
axiom_9 ).
cnf(c_0_43,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
axiom_3 ).
cnf(c_0_44,negated_conjecture,
minus(fifo_length,n1) = level(t_139),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
( gt(X1,level(t_139))
| ~ gt(plus(X1,n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
cnf(c_0_46,negated_conjecture,
( gt(plus(X1,n1),fifo_length)
| ~ gt(X1,level(t_139)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_47,negated_conjecture,
gt(fifo_length,level(t_139)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
~ gt(plus(fifo_length,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_26,c_0_45]),c_0_17]),c_0_28])]),c_0_34]),c_0_30]),c_0_31]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 14:55:04 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.62 % Version : CSE_E---1.5
% 0.20/0.62 % Problem : theBenchmark.p
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark.p
% 0.20/0.62 % SZS output start Proof
% See solution above
% 0.20/0.63 % Total time : 0.029000 s
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time : 0.034000 s
%------------------------------------------------------------------------------