TSTP Solution File: LCL174-3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL174-3 : TPTP v8.1.0. Released v2.3.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 : n014.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:47:07 EDT 2022

% Result   : Unsatisfiable 0.21s 0.60s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   24 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f73,plain,
    $false,
    inference(subsumption_resolution,[],[f65,f10]) ).

fof(f10,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f6,axiom,
    ! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f65,plain,
    ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    inference(resolution,[],[f36,f13]) ).

fof(f13,plain,
    ~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6]) ).

fof(f9,axiom,
    ~ theorem(implies(implies(p,q),implies(implies(q,r),implies(p,r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f36,plain,
    ! [X3,X4,X5] :
      ( theorem(or(X3,or(X4,X5)))
      | ~ axiom(or(X4,or(X3,X5))) ),
    inference(resolution,[],[f22,f7]) ).

fof(f7,axiom,
    ! [X3] :
      ( theorem(X3)
      | ~ axiom(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f22,plain,
    ! [X6,X7,X5] :
      ( ~ theorem(or(X6,or(X5,X7)))
      | theorem(or(X5,or(X6,X7))) ),
    inference(resolution,[],[f18,f12]) ).

fof(f12,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X0),X1))
      | theorem(X1)
      | ~ theorem(X0) ),
    inference(resolution,[],[f11,f7]) ).

fof(f11,plain,
    ! [X3,X4] :
      ( ~ theorem(or(not(X4),X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f8,axiom,
    ! [X3,X4] :
      ( ~ theorem(implies(X4,X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL174-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 01:41:06 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.58  % (13505)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.59  % (13497)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.59  % (13490)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.59  % (13514)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.60  % (13505)First to succeed.
% 0.21/0.60  % (13498)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.60  % (13505)Refutation found. Thanks to Tanya!
% 0.21/0.60  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.60  % (13505)------------------------------
% 0.21/0.60  % (13505)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.60  % (13505)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.60  % (13505)Termination reason: Refutation
% 0.21/0.60  
% 0.21/0.60  % (13505)Memory used [KB]: 895
% 0.21/0.60  % (13505)Time elapsed: 0.157 s
% 0.21/0.60  % (13505)Instructions burned: 4 (million)
% 0.21/0.60  % (13505)------------------------------
% 0.21/0.60  % (13505)------------------------------
% 0.21/0.60  % (13484)Success in time 0.245 s
%------------------------------------------------------------------------------