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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV121+1 : TPTP v8.1.2. Bugfixed 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:36:39 EDT 2023

% Result   : Theorem 0.52s 0.58s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   69
% Syntax   : Number of formulae    :   74 (   4 unt;  66 typ;   0 def)
%            Number of atoms       :   40 (   6 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :   35 (   3   ~;   0   |;  23   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  144 (  50   >;  94   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   3 prp; 0-4 aty)
%            Number of functors    :   59 (  59 usr;  14 con; 0-7 aty)
%            Number of variables   :   12 (   0 sgn;  12   !;   0   ?;   0   :)

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

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

tff(decl_24,type,
    lt: ( $i * $i ) > $o ).

tff(decl_25,type,
    geq: ( $i * $i ) > $o ).

tff(decl_26,type,
    pred: $i > $i ).

tff(decl_27,type,
    succ: $i > $i ).

tff(decl_28,type,
    n0: $i ).

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

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

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

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

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

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

tff(decl_35,type,
    trans: $i > $i ).

tff(decl_36,type,
    inv: $i > $i ).

tff(decl_37,type,
    tptp_update3: ( $i * $i * $i * $i ) > $i ).

tff(decl_38,type,
    tptp_madd: ( $i * $i ) > $i ).

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

tff(decl_40,type,
    tptp_mmul: ( $i * $i ) > $i ).

tff(decl_41,type,
    tptp_minus_1: $i ).

tff(decl_42,type,
    sum: ( $i * $i * $i ) > $i ).

tff(decl_43,type,
    tptp_float_0_0: $i ).

tff(decl_44,type,
    n1: $i ).

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

tff(decl_46,type,
    n2: $i ).

tff(decl_47,type,
    n3: $i ).

tff(decl_48,type,
    n4: $i ).

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

tff(decl_50,type,
    minus: ( $i * $i ) > $i ).

tff(decl_51,type,
    tptp_update2: ( $i * $i * $i ) > $i ).

tff(decl_52,type,
    true: $o ).

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

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

tff(decl_55,type,
    n6: $i ).

tff(decl_56,type,
    q_ds1_filter: $i ).

tff(decl_57,type,
    r_ds1_filter: $i ).

tff(decl_58,type,
    pminus_ds1_filter: $i ).

tff(decl_59,type,
    epred1_4: ( $i * $i * $i * $i ) > $o ).

tff(decl_60,type,
    epred2_0: $o ).

tff(decl_61,type,
    esk1_2: ( $i * $i ) > $i ).

tff(decl_62,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_63,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_64,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_65,type,
    esk5_2: ( $i * $i ) > $i ).

tff(decl_66,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_67,type,
    esk7_3: ( $i * $i * $i ) > $i ).

tff(decl_68,type,
    esk8_3: ( $i * $i * $i ) > $i ).

tff(decl_69,type,
    esk9_3: ( $i * $i * $i ) > $i ).

tff(decl_70,type,
    esk10_3: ( $i * $i * $i ) > $i ).

tff(decl_71,type,
    esk11_3: ( $i * $i * $i ) > $i ).

tff(decl_72,type,
    esk12_3: ( $i * $i * $i ) > $i ).

tff(decl_73,type,
    esk13_3: ( $i * $i * $i ) > $i ).

tff(decl_74,type,
    esk14_3: ( $i * $i * $i ) > $i ).

tff(decl_75,type,
    esk15_3: ( $i * $i * $i ) > $i ).

tff(decl_76,type,
    esk16_3: ( $i * $i * $i ) > $i ).

tff(decl_77,type,
    esk17_3: ( $i * $i * $i ) > $i ).

tff(decl_78,type,
    esk18_3: ( $i * $i * $i ) > $i ).

tff(decl_79,type,
    esk19_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(decl_80,type,
    esk20_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(decl_81,type,
    esk21_6: ( $i * $i * $i * $i * $i * $i ) > $i ).

tff(decl_82,type,
    esk22_6: ( $i * $i * $i * $i * $i * $i ) > $i ).

tff(decl_83,type,
    esk23_4: ( $i * $i * $i * $i ) > $i ).

tff(decl_84,type,
    esk24_4: ( $i * $i * $i * $i ) > $i ).

tff(decl_85,type,
    esk25_4: ( $i * $i * $i * $i ) > $i ).

tff(decl_86,type,
    esk26_4: ( $i * $i * $i * $i ) > $i ).

tff(decl_87,type,
    esk27_4: ( $i * $i * $i * $i ) > $i ).

fof(quaternion_ds1_symm_0014,conjecture,
    ( ( ! [X14,X18] :
          ( ( leq(n0,X14)
            & leq(n0,X18)
            & leq(X14,minus(n6,n1))
            & leq(X18,minus(n6,n1)) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,minus(n3,n1))
            & leq(X20,minus(n3,n1)) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
      & ! [X21,X22] :
          ( ( leq(n0,X21)
            & leq(n0,X22)
            & leq(X21,minus(n6,n1))
            & leq(X22,minus(n6,n1)) )
         => a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) ) )
   => true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0014) ).

fof(ttrue,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).

fof(c_0_2,plain,
    ( epred2_0
  <=> ( ! [X14,X18] :
          ( ( leq(n0,X14)
            & leq(n0,X18)
            & leq(X14,minus(n6,n1))
            & leq(X18,minus(n6,n1)) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,minus(n3,n1))
            & leq(X20,minus(n3,n1)) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
      & ! [X21,X22] :
          ( ( leq(n0,X21)
            & leq(n0,X22)
            & leq(X21,minus(n6,n1))
            & leq(X22,minus(n6,n1)) )
         => a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) ) ) ),
    introduced(definition) ).

fof(c_0_3,negated_conjecture,
    ~ ( epred2_0
     => true ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0014]),c_0_2]) ).

fof(c_0_4,negated_conjecture,
    ( epred2_0
    & ~ true ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    ~ true,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    true,
    inference(split_conjunct,[status(thm)],[ttrue]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWV121+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 29 03:52:56 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.52/0.58  % Version  : CSE_E---1.5
% 0.52/0.58  % Problem  : theBenchmark.p
% 0.52/0.58  % Proof found
% 0.52/0.58  % SZS status Theorem for theBenchmark.p
% 0.52/0.58  % SZS output start Proof
% See solution above
% 0.52/0.59  % Total time : 0.019000 s
% 0.52/0.59  % SZS output end Proof
% 0.52/0.59  % Total time : 0.024000 s
%------------------------------------------------------------------------------