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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL268-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 : n029.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:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f66,plain,
    $false,
    inference(resolution,[],[f60,f46]) ).

fof(f46,plain,
    ~ theorem(or(not(p),p)),
    inference(resolution,[],[f42,f13]) ).

fof(f13,plain,
    ~ theorem(not(or(not(or(not(p),p)),not(or(not(p),p))))),
    inference(definition_unfolding,[],[f11,f12]) ).

fof(f12,plain,
    ! [X6,X5] : equivalent(X5,X6) = not(or(not(or(not(X5),X6)),not(or(not(X6),X5)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

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

fof(f9,axiom,
    ! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).

fof(f10,axiom,
    ! [X6,X5] : equivalent(X5,X6) = and(implies(X5,X6),implies(X6,X5)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).

fof(f11,axiom,
    ~ theorem(equivalent(p,p)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f42,plain,
    ! [X0] :
      ( theorem(not(or(not(X0),not(X0))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f28,f17]) ).

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

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

fof(f28,plain,
    ! [X0] : theorem(or(X0,not(or(X0,X0)))),
    inference(resolution,[],[f27,f20]) ).

fof(f20,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f14,f7]) ).

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

fof(f14,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f26,f17]) ).

fof(f26,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f15,f7]) ).

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f60,plain,
    ! [X4] : theorem(or(not(X4),X4)),
    inference(resolution,[],[f55,f21]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f20,f17]) ).

fof(f55,plain,
    ! [X8,X7] : theorem(or(X7,or(not(X8),X8))),
    inference(resolution,[],[f50,f22]) ).

fof(f22,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f16,f7]) ).

fof(f16,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f49,f17]) ).

fof(f49,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f19,f7]) ).

fof(f19,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/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32  % Computer : n029.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 01:59:26 EDT 2022
% 0.11/0.32  % CPUTime    : 
% 0.17/0.47  % (30158)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.17/0.48  % (30146)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.17/0.48  % (30167)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.17/0.49  % (30159)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.17/0.49  % (30167)First to succeed.
% 0.17/0.49  % (30167)Refutation found. Thanks to Tanya!
% 0.17/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49  % (30167)------------------------------
% 0.17/0.49  % (30167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49  % (30167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49  % (30167)Termination reason: Refutation
% 0.17/0.49  
% 0.17/0.49  % (30167)Memory used [KB]: 5373
% 0.17/0.49  % (30167)Time elapsed: 0.058 s
% 0.17/0.49  % (30167)Instructions burned: 2 (million)
% 0.17/0.49  % (30167)------------------------------
% 0.17/0.49  % (30167)------------------------------
% 0.17/0.49  % (30143)Success in time 0.17 s
%------------------------------------------------------------------------------