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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL193-1 : TPTP v8.1.0. Released v1.1.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 : n022.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:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f341,plain,
    $false,
    inference(resolution,[],[f326,f75]) ).

fof(f75,plain,
    ! [X4] : theorem(or(not(X4),X4)),
    inference(resolution,[],[f28,f2]) ).

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

fof(f28,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X0),or(X1,X1)))
      | theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f22,f1]) ).

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

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

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

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

fof(f326,plain,
    ~ theorem(or(not(p),p)),
    inference(resolution,[],[f321,f104]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X2)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f25,f3]) ).

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

fof(f25,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(X2),or(X3,X0)))
      | ~ theorem(or(not(X0),X1))
      | theorem(or(not(X2),or(X3,X1))) ),
    inference(resolution,[],[f20,f8]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X2,X0)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f5,f7]) ).

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

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

fof(f321,plain,
    ~ theorem(or(not(or(p,r)),or(r,p))),
    inference(resolution,[],[f107,f9]) ).

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

fof(f107,plain,
    ! [X10,X11,X12,X13] :
      ( theorem(or(not(or(not(X13),X11)),or(not(or(X10,X13)),X12)))
      | ~ theorem(or(not(or(X10,X11)),X12)) ),
    inference(resolution,[],[f25,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LCL193-1 : TPTP v8.1.0. Released v1.1.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.13/0.34  % Computer : n022.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:43:56 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.54  % (14670)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.19/0.54  % (14662)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (14669)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.55  % (14663)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.55  % (14661)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.19/0.55  % (14671)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.59/0.56  % (14681)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.59/0.56  % (14664)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 (2999ds/48Mi)
% 1.59/0.56  % (14673)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)
% 1.59/0.56  % (14687)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.59/0.57  % (14672)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.59/0.57  % (14679)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.59/0.57  % (14688)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.59/0.57  % (14682)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)
% 1.74/0.58  % (14674)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)
% 1.74/0.58  % (14669)First to succeed.
% 1.74/0.58  % (14666)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.74/0.58  % (14669)Refutation found. Thanks to Tanya!
% 1.74/0.58  % SZS status Unsatisfiable for theBenchmark
% 1.74/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.74/0.58  % (14669)------------------------------
% 1.74/0.58  % (14669)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.74/0.58  % (14669)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.74/0.58  % (14669)Termination reason: Refutation
% 1.74/0.58  
% 1.74/0.58  % (14669)Memory used [KB]: 5628
% 1.74/0.58  % (14669)Time elapsed: 0.153 s
% 1.74/0.58  % (14669)Instructions burned: 20 (million)
% 1.74/0.58  % (14669)------------------------------
% 1.74/0.58  % (14669)------------------------------
% 1.74/0.58  % (14658)Success in time 0.231 s
%------------------------------------------------------------------------------