TSTP Solution File: HEN009-2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : HEN009-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --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 16:24:27 EDT 2022

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (  13 unt;   0 def)
%            Number of atoms       :   69 (   3 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   68 (  34   ~;  32   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f267,plain,
    $false,
    inference(avatar_sat_refutation,[],[f262,f264,f266]) ).

fof(f266,plain,
    ~ spl0_11,
    inference(avatar_contradiction_clause,[],[f265]) ).

fof(f265,plain,
    ( $false
    | ~ spl0_11 ),
    inference(subsumption_resolution,[],[f261,f164]) ).

fof(f164,plain,
    ~ less_equal(idQa,idQ__idQ_idQa),
    inference(subsumption_resolution,[],[f162,f21]) ).

fof(f21,axiom,
    idQa != idQ__idQ_idQa,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_one_inversion_equals_three) ).

fof(f162,plain,
    ( ~ less_equal(idQa,idQ__idQ_idQa)
    | idQa = idQ__idQ_idQa ),
    inference(resolution,[],[f150,f6]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ less_equal(X1,X0)
      | ~ less_equal(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_equal_and_equal) ).

fof(f150,plain,
    less_equal(idQ__idQ_idQa,idQa),
    inference(subsumption_resolution,[],[f142,f83]) ).

fof(f83,plain,
    less_equal(idQ_idQa,idQ_idQa),
    inference(resolution,[],[f35,f19]) ).

fof(f19,axiom,
    quotient(identity,idQa,idQ_idQa),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQa) ).

fof(f35,plain,
    ! [X10,X11] :
      ( ~ quotient(X10,idQa,X11)
      | less_equal(X11,idQ_idQa) ),
    inference(subsumption_resolution,[],[f34,f7]) ).

fof(f7,axiom,
    ! [X0] : less_equal(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_is_largest) ).

fof(f34,plain,
    ! [X10,X11] :
      ( ~ less_equal(X10,identity)
      | less_equal(X11,idQ_idQa)
      | ~ quotient(X10,idQa,X11) ),
    inference(resolution,[],[f19,f17]) ).

fof(f17,axiom,
    ! [X2,X10,X0,X1,X9] :
      ( ~ quotient(X1,X2,X10)
      | ~ quotient(X0,X2,X9)
      | less_equal(X9,X10)
      | ~ less_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy_implies_xQzLEyQz) ).

fof(f142,plain,
    ( ~ less_equal(idQ_idQa,idQ_idQa)
    | less_equal(idQ__idQ_idQa,idQa) ),
    inference(resolution,[],[f37,f19]) ).

fof(f37,plain,
    ! [X6,X5] :
      ( ~ quotient(identity,X5,X6)
      | ~ less_equal(X6,idQ_idQa)
      | less_equal(idQ__idQ_idQa,X5) ),
    inference(resolution,[],[f20,f15]) ).

fof(f15,axiom,
    ! [X2,X10,X0,X1,X9] :
      ( ~ quotient(X0,X2,X10)
      | ~ quotient(X0,X1,X9)
      | ~ less_equal(X9,X2)
      | less_equal(X10,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xQyLEz_implies_xQzLEy) ).

fof(f20,axiom,
    quotient(identity,idQ_idQa,idQ__idQ_idQa),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).

fof(f261,plain,
    ( less_equal(idQa,idQ__idQ_idQa)
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f259,plain,
    ( spl0_11
  <=> less_equal(idQa,idQ__idQ_idQa) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).

fof(f264,plain,
    spl0_10,
    inference(avatar_contradiction_clause,[],[f263]) ).

fof(f263,plain,
    ( $false
    | spl0_10 ),
    inference(subsumption_resolution,[],[f257,f126]) ).

fof(f126,plain,
    less_equal(idQ_idQa,a),
    inference(subsumption_resolution,[],[f117,f68]) ).

fof(f68,plain,
    less_equal(idQa,idQa),
    inference(resolution,[],[f28,f18]) ).

fof(f18,axiom,
    quotient(identity,a,idQa),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_a) ).

fof(f28,plain,
    ! [X10,X11] :
      ( ~ quotient(X10,a,X11)
      | less_equal(X11,idQa) ),
    inference(subsumption_resolution,[],[f27,f7]) ).

fof(f27,plain,
    ! [X10,X11] :
      ( less_equal(X11,idQa)
      | ~ quotient(X10,a,X11)
      | ~ less_equal(X10,identity) ),
    inference(resolution,[],[f18,f17]) ).

fof(f117,plain,
    ( ~ less_equal(idQa,idQa)
    | less_equal(idQ_idQa,a) ),
    inference(resolution,[],[f30,f18]) ).

fof(f30,plain,
    ! [X6,X5] :
      ( ~ quotient(identity,X5,X6)
      | less_equal(idQ_idQa,X5)
      | ~ less_equal(X6,idQa) ),
    inference(resolution,[],[f19,f15]) ).

fof(f257,plain,
    ( ~ less_equal(idQ_idQa,a)
    | spl0_10 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f255,plain,
    ( spl0_10
  <=> less_equal(idQ_idQa,a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).

fof(f262,plain,
    ( ~ spl0_10
    | spl0_11 ),
    inference(avatar_split_clause,[],[f110,f259,f255]) ).

fof(f110,plain,
    ( less_equal(idQa,idQ__idQ_idQa)
    | ~ less_equal(idQ_idQa,a) ),
    inference(resolution,[],[f24,f20]) ).

fof(f24,plain,
    ! [X8,X7] :
      ( ~ quotient(identity,X7,X8)
      | ~ less_equal(X7,a)
      | less_equal(idQa,X8) ),
    inference(resolution,[],[f18,f16]) ).

fof(f16,axiom,
    ! [X2,X10,X0,X1,X9] :
      ( ~ quotient(X2,X1,X9)
      | ~ quotient(X2,X0,X10)
      | ~ less_equal(X0,X1)
      | less_equal(X9,X10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy_implies_zQyLEzQx) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : HEN009-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --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   : Mon Aug 29 23:06:43 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (16549)dis+4_1:1_bd=off:cond=fast:fde=unused:lcm=reverse:lma=on:nicw=on:nwc=2.0:s2a=on:s2agt=16:sac=on:sp=frequency:i=23:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/23Mi)
% 0.19/0.50  % (16561)lrs+1011_1:1_aac=none:bsr=unit_only:ep=R:sac=on:sos=all:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.50  % (16553)fmb+10_1:1_fmbes=contour:fmbsr=2.0:fmbsso=input_usage:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.19/0.50  TRYING [1]
% 0.19/0.50  TRYING [2]
% 0.19/0.50  TRYING [3]
% 0.19/0.51  % (16547)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (16553)Instruction limit reached!
% 0.19/0.51  % (16553)------------------------------
% 0.19/0.51  % (16553)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (16553)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (16553)Termination reason: Unknown
% 0.19/0.51  % (16553)Termination phase: Finite model building constraint generation
% 0.19/0.51  
% 0.19/0.51  % (16553)Memory used [KB]: 6140
% 0.19/0.51  % (16553)Time elapsed: 0.067 s
% 0.19/0.51  % (16553)Instructions burned: 8 (million)
% 0.19/0.51  % (16553)------------------------------
% 0.19/0.51  % (16553)------------------------------
% 0.19/0.51  % (16547)First to succeed.
% 0.19/0.51  % (16547)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (16547)------------------------------
% 0.19/0.51  % (16547)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (16547)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (16547)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (16547)Memory used [KB]: 6012
% 0.19/0.51  % (16547)Time elapsed: 0.108 s
% 0.19/0.51  % (16547)Instructions burned: 9 (million)
% 0.19/0.51  % (16547)------------------------------
% 0.19/0.51  % (16547)------------------------------
% 0.19/0.51  % (16537)Success in time 0.16 s
%------------------------------------------------------------------------------