TSTP Solution File: NUM918_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM918_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n002.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 : Wed Aug 31 18:07:11 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   24 (  20 unt;   3 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (  12   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   81 (   0 atm;  38 fun;   4 num;  39 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   39 (  29   !;  10   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_5,type,
    sK0: $int ).

tff(func_def_6,type,
    sK1: $int ).

tff(func_def_7,type,
    sF2: $int ).

tff(f231,plain,
    $false,
    inference(equality_resolution,[],[f204]) ).

tff(f204,plain,
    ! [X15: $int] : ( sK1 != X15 ),
    inference(superposition,[],[f47,f164]) ).

tff(f164,plain,
    ! [X2: $int,X3: $int] : ( $sum(X2,$sum($uminus(X2),X3)) = X3 ),
    inference(forward_demodulation,[],[f140,f42]) ).

tff(f42,plain,
    ! [X1: $int] : ( $sum(0,X1) = X1 ),
    inference(superposition,[],[f6,f4]) ).

tff(f4,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_140,[]) ).

tff(f6,plain,
    ! [X0: $int] : ( $sum(X0,0) = X0 ),
    introduced(theory_axiom_142,[]) ).

tff(f140,plain,
    ! [X2: $int,X3: $int] : ( $sum(X2,$sum($uminus(X2),X3)) = $sum(0,X3) ),
    inference(superposition,[],[f5,f8]) ).

tff(f8,plain,
    ! [X0: $int] : ( $sum(X0,$uminus(X0)) = 0 ),
    introduced(theory_axiom_145,[]) ).

tff(f5,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
    introduced(theory_axiom_141,[]) ).

tff(f47,plain,
    ! [X2: $int] : ( sK1 != $sum(sF2,X2) ),
    inference(superposition,[],[f23,f4]) ).

tff(f23,plain,
    ! [X2: $int] : ( sK1 != $sum(X2,sF2) ),
    inference(definition_folding,[],[f21,f22]) ).

tff(f22,plain,
    sF2 = $uminus(sK0),
    introduced(function_definition,[]) ).

tff(f21,plain,
    ! [X2: $int] : ( sK1 != $sum(X2,$uminus(sK0)) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f20,plain,
    ! [X2: $int] : ( sK1 != $sum(X2,$uminus(sK0)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).

tff(f19,plain,
    ( ? [X0: $int,X1: $int] :
      ! [X2: $int] : ( $sum(X2,$uminus(X0)) != X1 )
   => ! [X2: $int] : ( sK1 != $sum(X2,$uminus(sK0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f18,plain,
    ? [X0: $int,X1: $int] :
    ! [X2: $int] : ( $sum(X2,$uminus(X0)) != X1 ),
    inference(rectify,[],[f17]) ).

tff(f17,plain,
    ? [X1: $int,X0: $int] :
    ! [X2: $int] : ( $sum(X2,$uminus(X1)) != X0 ),
    inference(ennf_transformation,[],[f16]) ).

tff(f16,plain,
    ~ ! [X0: $int,X1: $int] :
      ? [X2: $int] : ( $sum(X2,$uminus(X1)) = X0 ),
    inference(rectify,[],[f3]) ).

tff(f3,plain,
    ~ ! [X1: $int,X0: $int] :
      ? [X2: $int] : ( $sum(X2,$uminus(X0)) = X1 ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X1: $int,X0: $int] :
      ? [X2: $int] : ( $difference(X2,X0) = X1 ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X1: $int,X0: $int] :
    ? [X2: $int] : ( $difference(X2,X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM918=1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n002.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 30 09:28:14 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.50  % (23114)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.21/0.50  % (23122)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.21/0.50  % (23106)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.21/0.52  % (23110)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.21/0.52  % (23114)First to succeed.
% 0.21/0.52  % (23101)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.21/0.52  % (23106)Instruction limit reached!
% 0.21/0.52  % (23106)------------------------------
% 0.21/0.52  % (23106)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (23106)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (23106)Termination reason: Unknown
% 0.21/0.52  % (23106)Termination phase: Saturation
% 0.21/0.52  
% 0.21/0.52  % (23106)Memory used [KB]: 5500
% 0.21/0.52  % (23106)Time elapsed: 0.132 s
% 0.21/0.52  % (23106)Instructions burned: 7 (million)
% 0.21/0.52  % (23102)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.52  % (23106)------------------------------
% 0.21/0.52  % (23106)------------------------------
% 0.21/0.52  % (23104)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.21/0.52  % (23113)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.21/0.52  % (23114)Refutation found. Thanks to Tanya!
% 0.21/0.52  % SZS status Theorem for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52  % (23114)------------------------------
% 0.21/0.52  % (23114)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (23114)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (23114)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (23114)Memory used [KB]: 1151
% 0.21/0.52  % (23114)Time elapsed: 0.126 s
% 0.21/0.52  % (23114)Instructions burned: 11 (million)
% 0.21/0.52  % (23114)------------------------------
% 0.21/0.52  % (23114)------------------------------
% 0.21/0.52  % (23098)Success in time 0.172 s
%------------------------------------------------------------------------------