TSTP Solution File: ALG002-1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : ALG002-1 : 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 : n019.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 15:38:44 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   28 (  13 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  27   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   23 (  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f159,plain,
    $false,
    inference(subsumption_resolution,[],[f158,f116]) ).

fof(f116,plain,
    greater_than_0(additive_inverse(multiplicative_identity)),
    inference(subsumption_resolution,[],[f115,f63]) ).

fof(f63,plain,
    greater_than_0(additive_inverse(multiplicative_inverse(a))),
    inference(subsumption_resolution,[],[f19,f62]) ).

fof(f62,plain,
    ~ product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity),
    inference(subsumption_resolution,[],[f57,f2]) ).

fof(f2,axiom,
    ~ product(multiplicative_identity,multiplicative_identity,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_abelian) ).

fof(f57,plain,
    ( ~ product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)
    | product(multiplicative_identity,multiplicative_identity,additive_identity) ),
    inference(resolution,[],[f47,f11]) ).

fof(f11,axiom,
    ! [X2,X0,X1] :
      ( ~ product(X1,X1,additive_identity)
      | product(X0,X0,additive_identity)
      | ~ product(X1,X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',square_to_0) ).

fof(f47,plain,
    product(multiplicative_inverse(a),a,multiplicative_identity),
    inference(resolution,[],[f25,f9]) ).

fof(f9,axiom,
    ! [X2,X0,X1] :
      ( product(X1,X0,X2)
      | ~ product(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_product) ).

fof(f25,plain,
    product(a,multiplicative_inverse(a),multiplicative_identity),
    inference(resolution,[],[f15,f6]) ).

fof(f6,axiom,
    ! [X0] :
      ( product(X0,multiplicative_inverse(X0),multiplicative_identity)
      | product(X0,X0,additive_identity) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_and_identity) ).

fof(f15,plain,
    ~ product(a,a,additive_identity),
    inference(resolution,[],[f13,f8]) ).

fof(f8,axiom,
    ! [X0] :
      ( ~ greater_than_0(X0)
      | ~ product(X0,X0,additive_identity) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greater_than_0_square) ).

fof(f13,axiom,
    greater_than_0(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_greater_than_0) ).

fof(f19,plain,
    ( product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)
    | greater_than_0(additive_inverse(multiplicative_inverse(a))) ),
    inference(resolution,[],[f14,f10]) ).

fof(f10,axiom,
    ! [X0] :
      ( greater_than_0(additive_inverse(X0))
      | product(X0,X0,additive_identity)
      | greater_than_0(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_and_inverse) ).

fof(f14,axiom,
    ~ greater_than_0(multiplicative_inverse(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_inverse_greater_than_0) ).

fof(f115,plain,
    ( ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
    | greater_than_0(additive_inverse(multiplicative_identity)) ),
    inference(subsumption_resolution,[],[f114,f13]) ).

fof(f114,plain,
    ( ~ greater_than_0(a)
    | ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
    | greater_than_0(additive_inverse(multiplicative_identity)) ),
    inference(resolution,[],[f46,f12]) ).

fof(f12,axiom,
    ! [X2,X0,X1] :
      ( ~ greater_than_0(X1)
      | ~ greater_than_0(X2)
      | greater_than_0(X0)
      | ~ product(X1,X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_and_greater_than_0) ).

fof(f46,plain,
    product(a,additive_inverse(multiplicative_inverse(a)),additive_inverse(multiplicative_identity)),
    inference(resolution,[],[f25,f5]) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( product(X0,additive_inverse(X1),additive_inverse(X2))
      | ~ product(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_to_inverse) ).

fof(f158,plain,
    ~ greater_than_0(additive_inverse(multiplicative_identity)),
    inference(subsumption_resolution,[],[f156,f63]) ).

fof(f156,plain,
    ( ~ greater_than_0(additive_inverse(multiplicative_inverse(a)))
    | ~ greater_than_0(additive_inverse(multiplicative_identity)) ),
    inference(resolution,[],[f56,f1]) ).

fof(f1,axiom,
    ! [X0] : product(X0,multiplicative_identity,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).

fof(f56,plain,
    ! [X4,X5] :
      ( ~ product(X5,X4,multiplicative_inverse(a))
      | ~ greater_than_0(additive_inverse(X4))
      | ~ greater_than_0(additive_inverse(X5)) ),
    inference(resolution,[],[f20,f3]) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ product(X0,X1,X2)
      | product(additive_inverse(X0),additive_inverse(X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_of_inverses1) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ product(X0,X1,multiplicative_inverse(a))
      | ~ greater_than_0(X1)
      | ~ greater_than_0(X0) ),
    inference(resolution,[],[f14,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ALG002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 : n019.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.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 29 15:26:35 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (31218)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.20/0.50  % (31210)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.20/0.50  % (31197)lrs+10_1:1_bd=off:drc=off:lcm=reverse:nwc=5.0:sd=1:sgt=16:spb=goal_then_units:ss=axioms:to=lpo:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.20/0.50  % (31205)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.50  TRYING [1]
% 0.20/0.50  TRYING [2]
% 0.20/0.50  % (31205)Instruction limit reached!
% 0.20/0.50  % (31205)------------------------------
% 0.20/0.50  % (31205)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  TRYING [3]
% 0.20/0.50  % (31197)Refutation not found, incomplete strategy% (31197)------------------------------
% 0.20/0.50  % (31197)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (31197)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (31197)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50  
% 0.20/0.50  % (31197)Memory used [KB]: 5756
% 0.20/0.50  % (31197)Time elapsed: 0.095 s
% 0.20/0.50  % (31197)Instructions burned: 2 (million)
% 0.20/0.50  % (31197)------------------------------
% 0.20/0.50  % (31197)------------------------------
% 0.20/0.50  % (31205)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (31205)Termination reason: Unknown
% 0.20/0.50  % (31205)Termination phase: Saturation
% 0.20/0.50  
% 0.20/0.50  % (31205)Memory used [KB]: 5884
% 0.20/0.50  % (31205)Time elapsed: 0.098 s
% 0.20/0.50  % (31205)Instructions burned: 6 (million)
% 0.20/0.50  % (31205)------------------------------
% 0.20/0.50  % (31205)------------------------------
% 0.20/0.50  % (31216)lrs+1010_1:1_bd=off:fsr=off:sd=1:sos=on:ss=axioms:i=67:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/67Mi)
% 0.20/0.50  % (31216)Refutation not found, incomplete strategy% (31216)------------------------------
% 0.20/0.50  % (31216)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (31216)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (31216)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50  
% 0.20/0.50  % (31216)Memory used [KB]: 5756
% 0.20/0.50  % (31216)Time elapsed: 0.101 s
% 0.20/0.50  % (31216)------------------------------
% 0.20/0.50  % (31216)------------------------------
% 0.20/0.50  % (31218)First to succeed.
% 0.20/0.51  % (31202)lrs+1010_1:4_amm=off:bce=on:sd=1:sos=on:ss=included:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (31202)Refutation not found, incomplete strategy% (31202)------------------------------
% 0.20/0.51  % (31202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (31210)Instruction limit reached!
% 0.20/0.51  % (31210)------------------------------
% 0.20/0.51  % (31210)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (31210)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (31210)Termination reason: Unknown
% 0.20/0.51  % (31210)Termination phase: Finite model building SAT solving
% 0.20/0.51  
% 0.20/0.51  % (31210)Memory used [KB]: 5884
% 0.20/0.51  % (31210)Time elapsed: 0.059 s
% 0.20/0.51  % (31210)Instructions burned: 7 (million)
% 0.20/0.51  % (31210)------------------------------
% 0.20/0.51  % (31210)------------------------------
% 0.20/0.51  % (31202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (31202)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51  
% 0.20/0.51  % (31202)Memory used [KB]: 5756
% 0.20/0.51  % (31202)Time elapsed: 0.070 s
% 0.20/0.51  % (31202)------------------------------
% 0.20/0.51  % (31202)------------------------------
% 0.20/0.51  % (31218)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (31218)------------------------------
% 0.20/0.51  % (31218)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (31218)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (31218)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (31218)Memory used [KB]: 5884
% 0.20/0.51  % (31218)Time elapsed: 0.062 s
% 0.20/0.51  % (31218)Instructions burned: 6 (million)
% 0.20/0.51  % (31218)------------------------------
% 0.20/0.51  % (31218)------------------------------
% 0.20/0.51  % (31191)Success in time 0.152 s
%------------------------------------------------------------------------------