↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HWV017-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 : n015.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:57 PM UTC 2026

% Result   : Unsatisfiable 1.35s 1.74s
% Output   : CNFRefutation 1.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   28
% Syntax   : Number of clauses     :   93 (  28 unt;  31 nHn;  79 RR)
%            Number of literals    :  237 (  45 equ; 104 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   87 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_8,axiom,
    ( gt(plus(X1,n1),plus(X2,n1))
    | ~ gt(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_8) ).

cnf(axiom_19,axiom,
    plus(n0,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).

cnf(axiom_76,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_76) ).

cnf(axiom_21,axiom,
    level(X1) = int_level(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

cnf(axiom_58,axiom,
    ( p_Reset(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_58) ).

cnf(axiom_52,axiom,
    ( p_Reset(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_52) ).

cnf(axiom_10,axiom,
    ( gt(X1,X2)
    | X2 = X1
    | ~ gt(plus(X1,n1),X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_10) ).

cnf(axiom_70,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_70) ).

cnf(axiom_30,axiom,
    ( ~ p_Reset(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_30) ).

cnf(axiom_9,axiom,
    ( gt(X1,X2)
    | ~ gt(plus(X1,n1),plus(X2,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_9) ).

cnf(axiom_2,axiom,
    gt(plus(X1,n1),n0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).

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(quest_2,negated_conjecture,
    p_Rd(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_3,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

cnf(axiom_3,axiom,
    ( gt(X1,minus(X1,n1))
    | ~ gt(X1,n0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_3) ).

cnf(axiom_23,axiom,
    ( int_level(X1) = fifo_length
    | ~ p_Full(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_23) ).

cnf(axiom_18,axiom,
    ( X1 = X2
    | plus(X1,n1) != plus(X2,n1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_18) ).

cnf(quest_5,negated_conjecture,
    p_Full(plus(t_139,n1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

cnf(quest_1,negated_conjecture,
    ~ gt(level(t_139),fifo_length),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

cnf(axiom_78,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | int_level(plus(X1,n1)) = int_level(X1)
    | ~ p_Rd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_78) ).

cnf(axiom_82,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | int_level(plus(X1,n1)) = int_level(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_82) ).

cnf(axiom_13,axiom,
    ( gt(X1,X3)
    | ~ gt(X1,X2)
    | ~ gt(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_13) ).

cnf(axiom_1,axiom,
    plus(X1,n1) != n0,
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_1) ).

cnf(axiom_22,axiom,
    ( p_Full(X1)
    | int_level(X1) != fifo_length ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_22) ).

cnf(axiom_15,axiom,
    ( X1 = n0
    | gt(X1,n0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_15) ).

cnf(quest_6,negated_conjecture,
    gt(fifo_length,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_6) ).

cnf(axiom_17,axiom,
    ~ gt(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).

cnf(c_0_28,axiom,
    ( gt(plus(X1,n1),plus(X2,n1))
    | ~ gt(X1,X2) ),
    axiom_8 ).

cnf(c_0_29,axiom,
    plus(n0,X1) = X1,
    axiom_19 ).

cnf(c_0_30,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd(X1) ),
    axiom_76 ).

cnf(c_0_31,axiom,
    level(X1) = int_level(X1),
    axiom_21 ).

cnf(c_0_32,axiom,
    ( p_Reset(X1)
    | gt(int_level(X1),n0)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    axiom_58 ).

cnf(c_0_33,axiom,
    ( p_Reset(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_52 ).

cnf(c_0_34,axiom,
    ( gt(X1,X2)
    | X2 = X1
    | ~ gt(plus(X1,n1),X2) ),
    axiom_10 ).

cnf(c_0_35,plain,
    ( gt(plus(X1,n1),n1)
    | ~ gt(X1,n0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd_error(plus(X1,n1))
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,plain,
    ( p_Reset(X1)
    | p_Rd_error(plus(X1,n1))
    | gt(level(X1),n0)
    | ~ p_Wr(X1)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[c_0_32,c_0_31]) ).

cnf(c_0_38,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_70 ).

cnf(c_0_39,plain,
    ( p_Reset(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1))
    | ~ gt(level(X1),n0) ),
    inference(rw,[status(thm)],[c_0_33,c_0_31]) ).

cnf(c_0_40,axiom,
    ( ~ p_Reset(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_30 ).

cnf(c_0_41,axiom,
    ( gt(X1,X2)
    | ~ gt(plus(X1,n1),plus(X2,n1)) ),
    axiom_9 ).

cnf(c_0_42,plain,
    ( X1 = n1
    | gt(X1,n1)
    | ~ gt(X1,n0) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_43,axiom,
    gt(plus(X1,n1),n0),
    axiom_2 ).

cnf(c_0_44,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_45,plain,
    ( p_Rd_error(plus(X1,n1))
    | p_Reset(X1)
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(csr,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_46,negated_conjecture,
    p_Rd(t_139),
    quest_2 ).

cnf(c_0_47,negated_conjecture,
    ~ p_Reset(t_139),
    quest_4 ).

cnf(c_0_48,plain,
    ( p_Reset(X1)
    | p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1))
    | ~ gt(level(X1),n0) ),
    inference(rw,[status(thm)],[c_0_38,c_0_31]) ).

cnf(c_0_49,plain,
    ( ~ p_Rd(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd_error(plus(X1,n1))
    | ~ gt(level(X1),n0) ),
    inference(csr,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_50,plain,
    ( gt(X1,n0)
    | ~ gt(plus(X1,n1),n1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_29]) ).

cnf(c_0_51,plain,
    ( plus(X1,n1) = n1
    | gt(plus(X1,n1),n1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_52,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_44,c_0_31]),c_0_31]),c_0_31]) ).

cnf(c_0_53,negated_conjecture,
    ( p_Rd_error(plus(t_139,n1))
    | gt(level(t_139),n0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).

cnf(c_0_54,negated_conjecture,
    ~ p_Wr(t_139),
    quest_3 ).

cnf(c_0_55,plain,
    ( ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1))
    | ~ gt(level(X1),n0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_48,c_0_40]),c_0_49]) ).

cnf(c_0_56,plain,
    ( plus(X1,n1) = n1
    | gt(X1,n0) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,axiom,
    ( gt(X1,minus(X1,n1))
    | ~ gt(X1,n0) ),
    axiom_3 ).

cnf(c_0_58,negated_conjecture,
    ( minus(level(t_139),n1) = level(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_46])]),c_0_54]),c_0_47]) ).

cnf(c_0_59,axiom,
    ( int_level(X1) = fifo_length
    | ~ p_Full(X1) ),
    axiom_23 ).

cnf(c_0_60,axiom,
    ( X1 = X2
    | plus(X1,n1) != plus(X2,n1) ),
    axiom_18 ).

cnf(c_0_61,plain,
    ( plus(level(X1),n1) = n1
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_62,negated_conjecture,
    ( p_Rd_error(plus(t_139,n1))
    | gt(level(t_139),level(plus(t_139,n1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_53]) ).

cnf(c_0_63,plain,
    ( level(X1) = fifo_length
    | ~ p_Full(X1) ),
    inference(rw,[status(thm)],[c_0_59,c_0_31]) ).

cnf(c_0_64,negated_conjecture,
    p_Full(plus(t_139,n1)),
    quest_5 ).

cnf(c_0_65,negated_conjecture,
    ~ gt(level(t_139),fifo_length),
    quest_1 ).

cnf(c_0_66,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | gt(int_level(X1),n0)
    | int_level(plus(X1,n1)) = int_level(X1)
    | ~ p_Rd(X1) ),
    axiom_78 ).

cnf(c_0_67,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | int_level(plus(X1,n1)) = int_level(X1) ),
    axiom_82 ).

cnf(c_0_68,plain,
    ( level(X1) = X2
    | plus(X2,n1) != n1
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_69,negated_conjecture,
    p_Rd_error(plus(t_139,n1)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),c_0_65]) ).

cnf(c_0_70,axiom,
    ( gt(X1,X3)
    | ~ gt(X1,X2)
    | ~ gt(X2,X3) ),
    axiom_13 ).

cnf(c_0_71,plain,
    ( n0 = X1
    | gt(n0,X1)
    | ~ gt(n1,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_29]) ).

cnf(c_0_72,plain,
    ( gt(n1,plus(X1,n1))
    | ~ gt(n0,X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_73,axiom,
    plus(X1,n1) != n0,
    axiom_1 ).

cnf(c_0_74,axiom,
    ( p_Full(X1)
    | int_level(X1) != fifo_length ),
    axiom_22 ).

cnf(c_0_75,axiom,
    ( X1 = n0
    | gt(X1,n0) ),
    axiom_15 ).

cnf(c_0_76,negated_conjecture,
    gt(fifo_length,n0),
    quest_6 ).

cnf(c_0_77,plain,
    ( level(plus(X1,n1)) = level(X1)
    | p_Reset(X1)
    | p_Wr(X1)
    | gt(level(X1),n0)
    | ~ p_Rd(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_31]),c_0_31]),c_0_31]) ).

cnf(c_0_78,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_67,c_0_31]),c_0_31]) ).

cnf(c_0_79,negated_conjecture,
    ( level(t_139) = X1
    | plus(X1,n1) != n1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_46])]) ).

cnf(c_0_80,plain,
    ( gt(X1,n0)
    | ~ gt(X1,plus(X2,n1)) ),
    inference(spm,[status(thm)],[c_0_70,c_0_43]) ).

cnf(c_0_81,plain,
    ( gt(n0,plus(X1,n1))
    | ~ gt(n0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).

cnf(c_0_82,axiom,
    ~ gt(X1,X1),
    axiom_17 ).

cnf(c_0_83,plain,
    ( p_Full(X1)
    | level(X1) != fifo_length ),
    inference(rw,[status(thm)],[c_0_74,c_0_31]) ).

cnf(c_0_84,plain,
    ( level(X1) = n0
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(spm,[status(thm)],[c_0_55,c_0_75]) ).

cnf(c_0_85,plain,
    ( ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1))
    | ~ p_Full(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_63]),c_0_76])]) ).

cnf(c_0_86,plain,
    ( level(plus(X1,n1)) = level(X1)
    | p_Wr(X1)
    | p_Reset(X1)
    | gt(level(X1),n0) ),
    inference(csr,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_87,negated_conjecture,
    level(t_139) = n0,
    inference(spm,[status(thm)],[c_0_79,c_0_29]) ).

cnf(c_0_88,plain,
    ~ gt(n0,X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).

cnf(c_0_89,plain,
    ( fifo_length != n0
    | ~ p_Rd(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).

cnf(c_0_90,negated_conjecture,
    level(plus(t_139,n1)) = n0,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_54]),c_0_47]),c_0_88]) ).

cnf(c_0_91,negated_conjecture,
    fifo_length != n0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_69]),c_0_46])]) ).

cnf(c_0_92,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_90]),c_0_64])]),c_0_91]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HWV017-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 : n015.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:02 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.35/1.74  % Version  : CSE_E---1.7
% 1.35/1.74  % Problem  : theBenchmark.p
% 1.35/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.74  % SZS output start CNFRefutation
% See solution above
% 1.35/1.75  % Total time : 1.372s
%------------------------------------------------------------------------------