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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV377+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 : n029.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:19 EDT 2023

% Result   : Theorem 0.54s 0.59s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   51 (  12 unt;  31 typ;   0 def)
%            Number of atoms       :   28 (   8 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   22 (  14   ~;   2   |;   1   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   42 (  24   >;  18   *;   0   +;   0  <<)
%            Number of predicates  :   12 (   9 usr;   2 prp; 0-3 aty)
%            Number of functors    :   22 (  22 usr;   7 con; 0-3 aty)
%            Number of variables   :   43 (   7 sgn;  31   !;   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 ).

fof(l13_co,conjecture,
    ! [X1,X2,X3,X4] :
      ( ~ ok(triple(X1,X2,X3))
     => ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l13_co) ).

fof(ax41,axiom,
    ! [X1,X2,X3] :
      ( ~ ok(triple(X1,X2,X3))
     => X3 = bad ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).

fof(ax40,axiom,
    ! [X1,X2] :
      ( ok(triple(X1,X2,bad))
    <=> ~ $true ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).

fof(ax42,axiom,
    ! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ~ ok(triple(X1,X2,X3))
       => ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l13_co])]) ).

fof(c_0_5,plain,
    ! [X1,X2,X3] :
      ( ~ ok(triple(X1,X2,X3))
     => X3 = bad ),
    inference(fof_simplification,[status(thm)],[ax41]) ).

fof(c_0_6,negated_conjecture,
    ( ~ ok(triple(esk1_0,esk2_0,esk3_0))
    & ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X82,X83,X84] :
      ( ok(triple(X82,X83,X84))
      | X84 = bad ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_8,plain,
    ! [X1,X2] : ~ ok(triple(X1,X2,bad)),
    inference(fof_simplification,[status(thm)],[ax40]) ).

cnf(c_0_9,negated_conjecture,
    ~ ok(triple(esk1_0,esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ok(triple(X1,X2,X3))
    | X3 = bad ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X80,X81] : ~ ok(triple(X80,X81,bad)),
    inference(variable_rename,[status(thm)],[c_0_8]) ).

fof(c_0_12,plain,
    ! [X85,X86,X87,X88] : insert_cpq(triple(X85,X86,X87),X88) = triple(insert_pqp(X85,X88),insert_slb(X86,pair(X88,bottom)),X87),
    inference(variable_rename,[status(thm)],[ax42]) ).

cnf(c_0_13,negated_conjecture,
    ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    esk3_0 = bad,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ~ ok(triple(X1,X2,bad)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ok(insert_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ~ ok(insert_cpq(triple(X1,X2,bad),X3)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

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