TSTP Solution File: SWV383+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV383+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/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 21:38:21 EDT 2023

% Result   : Theorem 0.21s 0.58s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   45 (   5 unt;  33 typ;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   53 (  26   ~;  15   |;   4   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   42 (  24   >;  18   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   24 (  24 usr;   9 con; 0-3 aty)
%            Number of variables   :   36 (   0 sgn;  30   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    less_than: ( $i * $i ) > $o ).

tff(decl_23,type,
    strictly_less_than: ( $i * $i ) > $o ).

tff(decl_24,type,
    bottom: $i ).

tff(decl_25,type,
    create_slb: $i ).

tff(decl_26,type,
    isnonempty_slb: $i > $o ).

tff(decl_27,type,
    pair: ( $i * $i ) > $i ).

tff(decl_28,type,
    insert_slb: ( $i * $i ) > $i ).

tff(decl_29,type,
    contains_slb: ( $i * $i ) > $o ).

tff(decl_30,type,
    pair_in_list: ( $i * $i * $i ) > $o ).

tff(decl_31,type,
    remove_slb: ( $i * $i ) > $i ).

tff(decl_32,type,
    lookup_slb: ( $i * $i ) > $i ).

tff(decl_33,type,
    update_slb: ( $i * $i ) > $i ).

tff(decl_34,type,
    succ_cpq: ( $i * $i ) > $o ).

tff(decl_35,type,
    insert_cpq: ( $i * $i ) > $i ).

tff(decl_36,type,
    remove_cpq: ( $i * $i ) > $i ).

tff(decl_37,type,
    findmin_cpq_eff: $i > $i ).

tff(decl_38,type,
    removemin_cpq_eff: $i > $i ).

tff(decl_39,type,
    triple: ( $i * $i * $i ) > $i ).

tff(decl_40,type,
    check_cpq: $i > $o ).

tff(decl_41,type,
    contains_cpq: ( $i * $i ) > $o ).

tff(decl_42,type,
    bad: $i ).

tff(decl_43,type,
    ok: $i > $o ).

tff(decl_44,type,
    insert_pqp: ( $i * $i ) > $i ).

tff(decl_45,type,
    remove_pqp: ( $i * $i ) > $i ).

tff(decl_46,type,
    findmin_pqp_res: $i > $i ).

tff(decl_47,type,
    findmin_cpq_res: $i > $i ).

tff(decl_48,type,
    removemin_cpq_res: $i > $i ).

tff(decl_49,type,
    esk1_0: $i ).

tff(decl_50,type,
    esk2_0: $i ).

tff(decl_51,type,
    esk3_0: $i ).

tff(decl_52,type,
    esk4_0: $i ).

tff(decl_53,type,
    esk5_0: $i ).

tff(decl_54,type,
    esk6_0: $i ).

fof(l19_l20,lemma,
    ! [X1,X2,X3] :
      ( ( ~ check_cpq(triple(X1,X2,X3))
        | ~ ok(triple(X1,X2,X3)) )
     => ! [X4,X5,X6] :
          ( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
         => ( ~ ok(triple(X4,X5,X6))
            | ~ check_cpq(triple(X4,X5,X6)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).

fof(l19_co,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4,X5,X6] :
          ( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
         => ( ~ ok(triple(X4,X5,X6))
            | ~ check_cpq(triple(X4,X5,X6)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).

fof(c_0_2,lemma,
    ! [X1,X2,X3] :
      ( ( ~ check_cpq(triple(X1,X2,X3))
        | ~ ok(triple(X1,X2,X3)) )
     => ! [X4,X5,X6] :
          ( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
         => ( ~ ok(triple(X4,X5,X6))
            | ~ check_cpq(triple(X4,X5,X6)) ) ) ),
    inference(fof_simplification,[status(thm)],[l19_l20]) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4,X5,X6] :
            ( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
           => ( ~ ok(triple(X4,X5,X6))
              | ~ check_cpq(triple(X4,X5,X6)) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l19_co])]) ).

fof(c_0_4,lemma,
    ! [X120,X121,X122,X123,X124,X125] :
      ( ( check_cpq(triple(X120,X121,X122))
        | ~ succ_cpq(triple(X120,X121,X122),triple(X123,X124,X125))
        | ~ ok(triple(X123,X124,X125))
        | ~ check_cpq(triple(X123,X124,X125)) )
      & ( ok(triple(X120,X121,X122))
        | ~ succ_cpq(triple(X120,X121,X122),triple(X123,X124,X125))
        | ~ ok(triple(X123,X124,X125))
        | ~ check_cpq(triple(X123,X124,X125)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_5,negated_conjecture,
    ( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
    & succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
    & ok(triple(esk4_0,esk5_0,esk6_0))
    & check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_6,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
    | ~ ok(triple(X4,X5,X6))
    | ~ check_cpq(triple(X4,X5,X6)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ok(triple(esk4_0,esk5_0,esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    check_cpq(triple(esk4_0,esk5_0,esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWV383+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n031.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 29 09:48:26 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.56  start to proof: theBenchmark
% 0.21/0.58  % Version  : CSE_E---1.5
% 0.21/0.58  % Problem  : theBenchmark.p
% 0.21/0.58  % Proof found
% 0.21/0.58  % SZS status Theorem for theBenchmark.p
% 0.21/0.58  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.008000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.012000 s
%------------------------------------------------------------------------------