TSTP Solution File: SWW492_5 by Vampire-SAT---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.9
% Problem  : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d SAT

% Computer : n014.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 : Mon Jun 24 18:53:25 EDT 2024

% Result   : Theorem 0.20s 0.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   50 (  39 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   56 (  28   ~;  15   |;   4   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;   3 prp; 0-3 aty)
%            Number of functors    :   38 (  38 usr;   3 con; 0-5 aty)
%            Number of variables   :    3 (   3   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    a: $tType ).

tff(type_def_6,type,
    bool: $tType ).

tff(type_def_7,type,
    nat: $tType ).

tff(type_def_8,type,
    poly: $tType > $tType ).

tff(type_def_9,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    fundam296178794t_poly: 
      !>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(X0) ) ).

tff(func_def_1,type,
    fundam1280195782_psize: 
      !>[X0: $tType] : ( poly(X0) > nat ) ).

tff(func_def_2,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_3,type,
    if: 
      !>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).

tff(func_def_4,type,
    suc: nat > nat ).

tff(func_def_5,type,
    nat_case: 
      !>[X0: $tType] : ( ( X0 * fun(nat,X0) ) > fun(nat,X0) ) ).

tff(func_def_6,type,
    semiri532925092at_aux: 
      !>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).

tff(func_def_7,type,
    abs_poly: 
      !>[X0: $tType] : ( fun(nat,X0) > poly(X0) ) ).

tff(func_def_8,type,
    coeff: 
      !>[X0: $tType] : ( poly(X0) > fun(nat,X0) ) ).

tff(func_def_9,type,
    degree: 
      !>[X0: $tType] : ( poly(X0) > nat ) ).

tff(func_def_10,type,
    monom: 
      !>[X0: $tType] : ( ( X0 * nat ) > poly(X0) ) ).

tff(func_def_11,type,
    order1: 
      !>[X0: $tType] : ( ( X0 * poly(X0) ) > nat ) ).

tff(func_def_12,type,
    pCons: 
      !>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).

tff(func_def_13,type,
    pcompose: 
      !>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > poly(X0) ) ).

tff(func_def_14,type,
    poly1: 
      !>[X0: $tType] : ( poly(X0) > fun(X0,X0) ) ).

tff(func_def_15,type,
    poly_rec: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(poly(X1),fun(X0,X0))) * poly(X1) ) > X0 ) ).

tff(func_def_16,type,
    smult: 
      !>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).

tff(func_def_17,type,
    synthetic_div: 
      !>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(X0) ) ).

tff(func_def_18,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_19,type,
    fFalse: bool ).

tff(func_def_20,type,
    fTrue: bool ).

tff(func_def_21,type,
    fequal: 
      !>[X0: $tType] : ( ( X0 * X0 ) > bool ) ).

tff(func_def_22,type,
    p: poly(a) ).

tff(func_def_23,type,
    sK0: 
      !>[X0: $tType] : ( poly(X0) > X0 ) ).

tff(func_def_24,type,
    sK1: 
      !>[X0: $tType] : ( poly(X0) > poly(X0) ) ).

tff(func_def_25,type,
    sK2: 
      !>[X0: $tType] : ( fun(poly(X0),bool) > X0 ) ).

tff(func_def_26,type,
    sK3: 
      !>[X0: $tType] : ( fun(poly(X0),bool) > poly(X0) ) ).

tff(func_def_27,type,
    sK4: 
      !>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).

tff(func_def_28,type,
    sK5: 
      !>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).

tff(func_def_29,type,
    sK6: 
      !>[X0: $tType] : ( fun(nat,X0) > nat ) ).

tff(func_def_30,type,
    sK7: nat > nat ).

tff(func_def_31,type,
    sK8: nat > nat ).

tff(func_def_32,type,
    sK9: nat > nat ).

tff(func_def_33,type,
    sK10: fun(nat,bool) > nat ).

tff(func_def_34,type,
    sK11: fun(nat,bool) > nat ).

tff(func_def_35,type,
    sK12: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(pred_def_1,type,
    comm_semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    linordered_idom: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    idom: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    ring_char_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    comm_semiring_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_11,type,
    ord_less_eq: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_12,type,
    pp: bool > $o ).

tff(f638,plain,
    $false,
    inference(avatar_sat_refutation,[],[f586,f588,f637]) ).

tff(f637,plain,
    ~ spl13_2,
    inference(avatar_contradiction_clause,[],[f636]) ).

tff(f636,plain,
    ( $false
    | ~ spl13_2 ),
    inference(trivial_inequality_removal,[],[f618]) ).

tff(f618,plain,
    ( ( zero_zero(nat) != zero_zero(nat) )
    | ~ spl13_2 ),
    inference(superposition,[],[f405,f585]) ).

tff(f585,plain,
    ( ( zero_zero(nat) = suc(degree(a,p)) )
    | ~ spl13_2 ),
    inference(avatar_component_clause,[],[f583]) ).

tff(f583,plain,
    ( spl13_2
  <=> ( zero_zero(nat) = suc(degree(a,p)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).

tff(f405,plain,
    ! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
    inference(cnf_transformation,[],[f132]) ).

tff(f132,plain,
    ! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X6: nat] : ( zero_zero(nat) != suc(X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f588,plain,
    ~ spl13_1,
    inference(avatar_split_clause,[],[f576,f579]) ).

tff(f579,plain,
    ( spl13_1
  <=> ( p = zero_zero(poly(a)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).

tff(f576,plain,
    p != zero_zero(poly(a)),
    inference(duplicate_literal_removal,[],[f388]) ).

tff(f388,plain,
    ( ( p != zero_zero(poly(a)) )
    | ( p != zero_zero(poly(a)) ) ),
    inference(cnf_transformation,[],[f338]) ).

tff(f338,plain,
    ( ( ( zero_zero(nat) = suc(degree(a,p)) )
      | ( p = zero_zero(poly(a)) )
      | ( p = zero_zero(poly(a)) ) )
    & ( ( p != zero_zero(poly(a)) )
      | ( ( zero_zero(nat) != suc(degree(a,p)) )
        & ( p != zero_zero(poly(a)) ) ) ) ),
    inference(flattening,[],[f337]) ).

tff(f337,plain,
    ( ( ( zero_zero(nat) = suc(degree(a,p)) )
      | ( p = zero_zero(poly(a)) )
      | ( p = zero_zero(poly(a)) ) )
    & ( ( p != zero_zero(poly(a)) )
      | ( ( zero_zero(nat) != suc(degree(a,p)) )
        & ( p != zero_zero(poly(a)) ) ) ) ),
    inference(nnf_transformation,[],[f241]) ).

tff(f241,plain,
    ( ( ( zero_zero(nat) = suc(degree(a,p)) )
      | ( p = zero_zero(poly(a)) ) )
  <=> ( p != zero_zero(poly(a)) ) ),
    inference(ennf_transformation,[],[f128]) ).

tff(f128,plain,
    ( ( ( p != zero_zero(poly(a)) )
     => ( zero_zero(nat) = suc(degree(a,p)) ) )
  <=> ( p != zero_zero(poly(a)) ) ),
    inference(flattening,[],[f126]) ).

tff(f126,negated_conjecture,
    ~ ~ ( ( ( p != zero_zero(poly(a)) )
         => ( zero_zero(nat) = suc(degree(a,p)) ) )
      <=> ( p != zero_zero(poly(a)) ) ),
    inference(negated_conjecture,[],[f125]) ).

tff(f125,conjecture,
    ~ ( ( ( p != zero_zero(poly(a)) )
       => ( zero_zero(nat) = suc(degree(a,p)) ) )
    <=> ( p != zero_zero(poly(a)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f586,plain,
    ( spl13_1
    | spl13_2 ),
    inference(avatar_split_clause,[],[f577,f583,f579]) ).

tff(f577,plain,
    ( ( zero_zero(nat) = suc(degree(a,p)) )
    | ( p = zero_zero(poly(a)) ) ),
    inference(duplicate_literal_removal,[],[f390]) ).

tff(f390,plain,
    ( ( zero_zero(nat) = suc(degree(a,p)) )
    | ( p = zero_zero(poly(a)) )
    | ( p = zero_zero(poly(a)) ) ),
    inference(cnf_transformation,[],[f338]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% 0.07/0.12  % Command    : run_vampire %s %d SAT
% 0.12/0.33  % Computer : n014.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   : Wed Jun 19 05:43:39 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.35  This is a TF1_THM_EQU_NAR problem
% 0.12/0.35  Running first-order model finding
% 0.12/0.35  Running /export/starexec/sandbox/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27027)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27028)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27025)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27024)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27023)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27026)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.20/0.42  % (27028)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42  % (27025)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42  % (27026)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42  % (27022)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.20/0.43  % (27025)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.43  % Exception at run slice level
% 0.20/0.43  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.43  % Exception at run slice level
% 0.20/0.43  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.43  % (27027)Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.43  % (27027)------------------------------
% 0.20/0.43  % (27027)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43  % (27027)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.43  % (27027)Termination reason: Unknown
% 0.20/0.43  % (27027)Termination phase: Saturation
% 0.20/0.43  
% 0.20/0.43  % (27027)Memory used [KB]: 994
% 0.20/0.43  % (27027)Time elapsed: 0.007 s
% 0.20/0.43  % (27027)Instructions burned: 9 (million)
% 0.20/0.43  % (27027)------------------------------
% 0.20/0.43  % (27027)------------------------------
% 0.20/0.43  Version : Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43  call stack: 0x416001 0x1cd76a0 0x1cd5fa4 0x41c856 0x4193c6 0xa45fc5 0xa4c1bf 0xa4cf76 0xa4d5a0 0x769598 0x7693f1 0x4f70af 0x7735d4 0x762d9c 0x715101 0x54d462 0x669b24 0x53ec63 0x53b01e 0x4e7fbe 0x54f63d 0x1ceab70 0x489180 0x41f883
% 0.20/0.43  (use '--traceback on' to get a human-readable stack trace)
% 0.20/0.43  % Exception at run slice level
% 0.20/0.43  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.43  % (27028)First to succeed.
% 0.20/0.43  % (27028)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27021"
% 0.20/0.43  % (27023)Also succeeded, but the first one will report.
% 0.20/0.43  % (27021)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.43  % (27028)Refutation found. Thanks to Tanya!
% 0.20/0.43  % SZS status Theorem for theBenchmark
% 0.20/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.43  % (27028)------------------------------
% 0.20/0.43  % (27028)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43  % (27028)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.43  % (27028)Termination reason: Refutation
% 0.20/0.43  
% 0.20/0.43  % (27028)Memory used [KB]: 1044
% 0.20/0.43  % (27028)Time elapsed: 0.010 s
% 0.20/0.43  % (27028)Instructions burned: 13 (million)
% 0.20/0.43  % (27028)------------------------------
% 0.20/0.43  % (27028)------------------------------
% 0.20/0.43  % (27021)Success in time 0.068 s
%------------------------------------------------------------------------------