TSTP Solution File: LCL198-1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL198-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n026.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 : Sun May  5 07:44:26 EDT 2024

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

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

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

fof(f8956,plain,
    ! [X0] : ~ axiom(or(not(or(X0,not(p))),or(not(p),q))),
    inference(resolution,[],[f8816,f6]) ).

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

fof(f8816,plain,
    ! [X0] : ~ theorem(or(not(or(X0,not(p))),or(not(p),q))),
    inference(resolution,[],[f2114,f263]) ).

fof(f263,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X0))
      | ~ theorem(or(not(X1),X0)) ),
    inference(resolution,[],[f217,f21]) ).

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

fof(f7,axiom,
    ! [X3,X4] :
      ( ~ axiom(or(not(X4),X3))
      | theorem(X3)
      | ~ theorem(X4) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

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

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

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

fof(f97,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f63,f11]) ).

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

fof(f63,plain,
    ! [X0,X1] :
      ( ~ theorem(or(or(X0,X1),X1))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f32,f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f7,f2]) ).

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

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

fof(f10,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f7,f1]) ).

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

fof(f2114,plain,
    ! [X0] : ~ theorem(or(not(or(or(not(p),q),or(X0,not(p)))),or(not(p),q))),
    inference(resolution,[],[f434,f4]) ).

fof(f434,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(X0,or(or(not(p),q),not(p)))),X1))
      | ~ theorem(or(not(X1),or(not(p),q))) ),
    inference(resolution,[],[f216,f8]) ).

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

fof(f216,plain,
    ! [X0] : ~ theorem(or(not(or(X0,or(or(not(p),q),not(p)))),or(not(p),q))),
    inference(resolution,[],[f56,f2]) ).

fof(f56,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(or(not(p),q),not(p))),X0))
      | ~ theorem(or(not(X0),or(not(p),q))) ),
    inference(resolution,[],[f44,f8]) ).

fof(f44,plain,
    ~ theorem(or(not(or(or(not(p),q),not(p))),or(not(p),q))),
    inference(resolution,[],[f22,f3]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(not(p),or(not(p),q))),X0))
      | ~ theorem(or(not(X0),or(not(p),q))) ),
    inference(resolution,[],[f8,f9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : LCL198-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32  % Computer : n026.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   : Fri May  3 14:01:21 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.11/0.33  % (27830)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34  % (27831)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34  % (27834)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.34  % (27832)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34  % (27837)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34  % (27835)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34  % (27833)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.11/0.34  % (27836)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [2]
% 0.11/0.35  TRYING [3]
% 0.11/0.35  TRYING [3]
% 0.11/0.35  TRYING [3]
% 0.11/0.35  TRYING [3]
% 0.11/0.36  TRYING [4]
% 0.11/0.36  TRYING [4]
% 0.11/0.36  TRYING [4]
% 0.11/0.36  TRYING [4]
% 0.17/0.40  TRYING [5]
% 0.17/0.40  TRYING [5]
% 0.17/0.40  TRYING [5]
% 0.17/0.40  TRYING [5]
% 1.57/0.59  % (27833)First to succeed.
% 1.57/0.59  % (27833)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27830"
% 1.57/0.59  % (27833)Refutation found. Thanks to Tanya!
% 1.57/0.59  % SZS status Unsatisfiable for theBenchmark
% 1.57/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.57/0.59  % (27833)------------------------------
% 1.57/0.59  % (27833)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.57/0.59  % (27833)Termination reason: Refutation
% 1.57/0.59  
% 1.57/0.59  % (27833)Memory used [KB]: 3647
% 1.57/0.59  % (27833)Time elapsed: 0.245 s
% 1.57/0.59  % (27833)Instructions burned: 554 (million)
% 1.57/0.59  % (27830)Success in time 0.248 s
%------------------------------------------------------------------------------