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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL221-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 : n011.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:38 EDT 2024

% Result   : Unsatisfiable 193.79s 28.10s
% Output   : Refutation 193.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   31 (  18 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  16   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    8 (   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   :   82 (  82   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f355115,plain,
    $false,
    inference(resolution,[],[f355112,f9]) ).

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

fof(f355112,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(or(X0,X1),X2)),or(X1,X2)))),
    inference(resolution,[],[f288211,f4]) ).

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

fof(f288211,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(or(not(or(or(X1,X2),X3)),or(not(or(not(X1),X2)),or(X2,X3)))),X0))
      | theorem(X0) ),
    inference(resolution,[],[f288205,f7]) ).

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

fof(f288205,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(not(or(not(X0),X1)),or(X1,X2)))),
    inference(resolution,[],[f241498,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(f241498,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(X0),or(X1,or(X2,X3))))
      | theorem(or(not(X0),or(not(or(not(X2),X3)),or(X3,X1)))) ),
    inference(resolution,[],[f241494,f8]) ).

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

fof(f241494,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(not(or(not(X1),X2)),or(X2,X0)))),
    inference(resolution,[],[f198961,f4]) ).

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

fof(f198957,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(not(or(not(X0),X2)),or(X2,X1)))),
    inference(resolution,[],[f167279,f3]) ).

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

fof(f167276,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(not(or(not(X2),X1)),or(X1,X0)))),
    inference(resolution,[],[f25926,f4]) ).

fof(f25926,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(or(not(or(not(X1),X2)),or(not(or(or(X3,X2),X1)),or(X2,X3)))),X0))
      | theorem(X0) ),
    inference(resolution,[],[f25919,f7]) ).

fof(f25919,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(or(X2,X1),X0)),or(X1,X2)))),
    inference(resolution,[],[f4652,f5]) ).

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(f4652,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(X0),or(X1,or(or(X2,X3),X3))))
      | theorem(or(not(X0),or(X1,or(X3,X2)))) ),
    inference(resolution,[],[f4643,f8]) ).

fof(f4643,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(or(X1,X2),X2))),or(X0,or(X2,X1)))),
    inference(resolution,[],[f4634,f5]) ).

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

fof(f4632,plain,
    ! [X0,X1] : theorem(or(not(or(or(X0,X1),X1)),or(X1,X0))),
    inference(resolution,[],[f1449,f2]) ).

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

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

fof(f1446,plain,
    ! [X0,X1] : theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X1,X0))),
    inference(resolution,[],[f215,f4]) ).

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

fof(f163,plain,
    ! [X0,X1] : theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X1,X0))),
    inference(resolution,[],[f73,f1]) ).

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

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

fof(f12,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f3,f6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL221-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.36  % Computer : n011.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 13:27:19 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  % (12795)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38  % (12797)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38  % (12798)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.38  % (12799)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.38  % (12796)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38  % (12801)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.38  % (12802)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.38  % (12800)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.22/0.41  TRYING [4]
% 0.22/0.41  TRYING [4]
% 0.22/0.42  TRYING [4]
% 0.22/0.42  TRYING [4]
% 2.46/0.71  TRYING [5]
% 3.20/0.83  TRYING [5]
% 3.44/0.84  TRYING [5]
% 3.44/0.89  TRYING [5]
% 19.95/3.27  TRYING [6]
% 20.51/3.30  TRYING [6]
% 20.51/3.33  TRYING [6]
% 21.44/3.43  TRYING [6]
% 151.85/22.09  % (12801)Time limit reached!
% 151.85/22.09  % (12801)------------------------------
% 151.85/22.09  % (12801)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 151.85/22.09  % (12801)Termination reason: Time limit
% 151.85/22.09  % (12801)Termination phase: Saturation
% 151.85/22.09  
% 151.85/22.09  % (12801)Memory used [KB]: 60797
% 151.85/22.09  % (12801)Time elapsed: 21.700 s
% 151.85/22.09  % (12801)Instructions burned: 39854 (million)
% 151.85/22.09  % (12801)------------------------------
% 151.85/22.09  % (12801)------------------------------
% 151.85/22.10  % (13155)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_569 on theBenchmark for (569ds/0Mi)
% 151.85/22.10  TRYING [1]
% 151.85/22.10  TRYING [2]
% 151.85/22.11  TRYING [3]
% 151.85/22.12  TRYING [4]
% 153.67/22.36  TRYING [5]
% 166.72/24.21  TRYING [6]
% 181.81/26.38  TRYING [7]
% 181.81/26.41  TRYING [7]
% 182.67/26.53  TRYING [7]
% 193.79/28.07  % (12800)First to succeed.
% 193.79/28.08  % (12800)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12795"
% 193.79/28.10  % (12800)Refutation found. Thanks to Tanya!
% 193.79/28.10  % SZS status Unsatisfiable for theBenchmark
% 193.79/28.10  % SZS output start Proof for theBenchmark
% See solution above
% 193.79/28.10  % (12800)------------------------------
% 193.79/28.10  % (12800)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 193.79/28.10  % (12800)Termination reason: Refutation
% 193.79/28.10  
% 193.79/28.10  % (12800)Memory used [KB]: 152112
% 193.79/28.10  % (12800)Time elapsed: 27.697 s
% 193.79/28.10  % (12800)Instructions burned: 48740 (million)
% 193.79/28.10  % (12795)Success in time 27.582 s
%------------------------------------------------------------------------------