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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL230-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 : n019.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:40 EDT 2024

% Result   : Unsatisfiable 0.21s 0.57s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   22 (  11 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  21   ~;  13   |;   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9463,plain,
    $false,
    inference(resolution,[],[f9451,f2]) ).

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

fof(f9451,plain,
    ~ axiom(or(not(q),or(p,q))),
    inference(resolution,[],[f1897,f144]) ).

fof(f144,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f55,f2]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ axiom(or(X0,or(or(X0,X1),X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f34,f6]) ).

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

fof(f34,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(or(X0,X1),X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f14,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(f7,axiom,
    ! [X3,X4] :
      ( ~ axiom(or(not(X4),X3))
      | theorem(X3)
      | ~ theorem(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f14,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(f1897,plain,
    ! [X0] :
      ( ~ theorem(or(not(or(not(or(p,q)),r)),or(not(X0),r)))
      | ~ axiom(or(not(q),X0)) ),
    inference(resolution,[],[f364,f14]) ).

fof(f364,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),or(not(or(not(or(p,q)),r)),r)))
      | ~ axiom(or(not(q),X0)) ),
    inference(resolution,[],[f111,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(f111,plain,
    ~ theorem(or(not(q),or(not(or(not(or(p,q)),r)),r))),
    inference(resolution,[],[f76,f14]) ).

fof(f76,plain,
    ~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r))),
    inference(resolution,[],[f42,f22]) ).

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

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(f42,plain,
    ~ theorem(or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))),
    inference(resolution,[],[f24,f4]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL230-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n019.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   : Fri May  3 13:52:44 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  % (11335)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (11338)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37  % (11340)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.14/0.37  % (11341)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37  % (11339)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37  % (11342)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37  % (11344)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.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [2]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  % (11343)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.40  TRYING [4]
% 0.14/0.40  TRYING [4]
% 0.14/0.40  TRYING [4]
% 0.21/0.40  TRYING [4]
% 0.21/0.57  % (11340)First to succeed.
% 0.21/0.57  % (11340)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11335"
% 0.21/0.57  % (11340)Refutation found. Thanks to Tanya!
% 0.21/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57  % (11340)------------------------------
% 0.21/0.57  % (11340)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.57  % (11340)Termination reason: Refutation
% 0.21/0.57  
% 0.21/0.57  % (11340)Memory used [KB]: 3454
% 0.21/0.57  % (11340)Time elapsed: 0.200 s
% 0.21/0.57  % (11340)Instructions burned: 511 (million)
% 0.21/0.57  % (11335)Success in time 0.216 s
%------------------------------------------------------------------------------