TSTP Solution File: LCL117-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL117-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_sat --cores 0 -t %d %s

% Computer : n010.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:46:57 EDT 2022

% Result   : Unsatisfiable 1.72s 0.58s
% Output   : Refutation 1.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   5 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (  10   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   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   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,plain,
    $false,
    inference(subsumption_resolution,[],[f28,f2]) ).

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

fof(f28,plain,
    ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c)))),
    inference(resolution,[],[f25,f12]) ).

fof(f12,plain,
    ! [X11] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),X11))
      | ~ is_a_theorem(equivalent(equivalent(c,b),X11)) ),
    inference(resolution,[],[f5,f3]) ).

fof(f3,axiom,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_qyf) ).

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

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

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

fof(f25,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[],[f6,f2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LCL117-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_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 01:29:59 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 1.53/0.56  % (10198)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)
% 1.53/0.56  % (10206)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 1.72/0.57  % (10193)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 1.72/0.58  % (10217)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 1.72/0.58  % (10209)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 1.72/0.58  % (10198)First to succeed.
% 1.72/0.58  % (10201)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 1.72/0.58  % (10201)Instruction limit reached!
% 1.72/0.58  % (10201)------------------------------
% 1.72/0.58  % (10201)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.72/0.58  % (10198)Refutation found. Thanks to Tanya!
% 1.72/0.58  % SZS status Unsatisfiable for theBenchmark
% 1.72/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.72/0.58  % (10198)------------------------------
% 1.72/0.58  % (10198)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.72/0.58  % (10198)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.72/0.58  % (10198)Termination reason: Refutation
% 1.72/0.58  
% 1.72/0.58  % (10198)Memory used [KB]: 5373
% 1.72/0.58  % (10198)Time elapsed: 0.167 s
% 1.72/0.58  % (10198)Instructions burned: 2 (million)
% 1.72/0.58  % (10198)------------------------------
% 1.72/0.58  % (10198)------------------------------
% 1.72/0.58  % (10192)Success in time 0.232 s
%------------------------------------------------------------------------------