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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : LCL126-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 : n009.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 17:39:00 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  18   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f40,plain,
    $false,
    inference(resolution,[],[f35,f3]) ).

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_4) ).

fof(f35,plain,
    ! [X1] : ~ is_a_theorem(X1),
    inference(subsumption_resolution,[],[f31,f5]) ).

fof(f5,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f2,f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | is_a_theorem(X1)
      | ~ is_a_theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_3) ).

fof(f31,plain,
    ! [X1] :
      ( ~ is_a_theorem(X1)
      | ~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,a)),equivalent(a,c))) ),
    inference(resolution,[],[f10,f23]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(a,c),equivalent(a,c))))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f20,f7]) ).

fof(f7,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(X2,X1))) ),
    inference(resolution,[],[f5,f1]) ).

fof(f20,plain,
    ~ is_a_theorem(equivalent(equivalent(a,c),equivalent(a,c))),
    inference(resolution,[],[f9,f14]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f11,f5]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(a,c),equivalent(equivalent(a,b),equivalent(c,b)))))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f7,f4]) ).

fof(f4,axiom,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_2) ).

fof(f9,plain,
    ! [X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X4,X5),X6),equivalent(equivalent(equivalent(X4,X7),equivalent(X5,X7)),X6))),
    inference(resolution,[],[f6,f3]) ).

fof(f6,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X2))
      | is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
    inference(resolution,[],[f3,f1]) ).

fof(f10,plain,
    ! [X10,X11,X8,X9] :
      ( is_a_theorem(equivalent(equivalent(equivalent(X8,equivalent(X9,X10)),X11),equivalent(equivalent(X10,X9),X11)))
      | ~ is_a_theorem(X8) ),
    inference(resolution,[],[f6,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL126-1 : 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 : n009.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 01:34:50 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  % (2694)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.49  % (2702)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.20/0.49  % (2702)First to succeed.
% 0.20/0.49  % (2711)lrs+1011_1:1_afp=100000:afr=on:amm=sco:bd=preordered:cond=fast:newcnf=on:nm=4:sos=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50  % (2691)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.20/0.50  % (2696)dis+1011_1:16_fsr=off:nwc=2.0:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.50  % (2702)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (2702)------------------------------
% 0.20/0.50  % (2702)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (2702)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (2702)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (2702)Memory used [KB]: 5756
% 0.20/0.50  % (2702)Time elapsed: 0.101 s
% 0.20/0.50  % (2702)Instructions burned: 2 (million)
% 0.20/0.50  % (2702)------------------------------
% 0.20/0.50  % (2702)------------------------------
% 0.20/0.50  % (2687)Success in time 0.149 s
%------------------------------------------------------------------------------