TSTP Solution File: LCL215-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL215-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n012.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 May  1 03:11:32 EDT 2024

% Result   : Unsatisfiable 0.56s 0.76s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  14 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   54 (  32   ~;  22   |;   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   :   51 (  51   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f452,plain,
    $false,
    inference(subsumption_resolution,[],[f451,f149]) ).

fof(f149,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(forward_literal_rewriting,[],[f148,f12]) ).

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

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',axiom_1_4) ).

fof(f7,axiom,
    ! [X3,X4] :
      ( ~ axiom(or(not(X4),X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    file('/export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',rule_2) ).

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

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',axiom_1_3) ).

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

fof(f6,axiom,
    ! [X3] :
      ( theorem(X3)
      | ~ axiom(X3) ),
    file('/export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',rule_1) ).

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

fof(f11,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/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',axiom_1_2) ).

fof(f15,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,or(X1,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/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',axiom_1_5) ).

fof(f451,plain,
    ~ theorem(or(q,not(q))),
    inference(forward_literal_rewriting,[],[f447,f12]) ).

fof(f447,plain,
    ~ theorem(or(not(q),q)),
    inference(resolution,[],[f435,f142]) ).

fof(f142,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(or(X0,X1))))
      | ~ theorem(or(not(X1),X0)) ),
    inference(forward_literal_rewriting,[],[f137,f12]) ).

fof(f137,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X0))
      | ~ theorem(or(not(X1),X0)) ),
    inference(resolution,[],[f81,f41]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X2,or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(forward_literal_rewriting,[],[f16,f15]) ).

fof(f16,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(not(or(X2,X0)),or(X2,X1))) ),
    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/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',axiom_1_6) ).

fof(f81,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(forward_literal_rewriting,[],[f77,f12]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(or(X0,X1),X1)) ),
    inference(resolution,[],[f39,f13]) ).

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

fof(f435,plain,
    ~ theorem(or(q,not(or(q,q)))),
    inference(forward_literal_rewriting,[],[f429,f12]) ).

fof(f429,plain,
    ~ theorem(or(not(or(q,q)),q)),
    inference(resolution,[],[f193,f41]) ).

fof(f193,plain,
    ! [X0] : ~ theorem(or(not(or(q,p)),or(not(or(not(or(X0,p)),or(X0,q))),q))),
    inference(resolution,[],[f116,f5]) ).

fof(f116,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(not(p),q)),X0))
      | ~ theorem(or(not(or(q,p)),or(not(X0),q))) ),
    inference(resolution,[],[f62,f3]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(p,q)),X1))
      | ~ axiom(or(not(or(not(p),q)),X0))
      | ~ theorem(or(not(X1),or(not(X0),q))) ),
    inference(resolution,[],[f38,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/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',rule_3) ).

fof(f38,plain,
    ! [X0] :
      ( ~ theorem(or(not(or(p,q)),or(not(X0),q)))
      | ~ axiom(or(not(or(not(p),q)),X0)) ),
    inference(resolution,[],[f15,f19]) ).

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

fof(f9,axiom,
    ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))),
    file('/export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799',prove_this) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL215-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n012.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 16:38:26 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.7Dwpf4kHLh/Vampire---4.8_799
% 0.56/0.75  % (1220)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.56/0.75  % (1213)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.75  % (1215)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.75  % (1216)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.75  % (1214)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.56/0.75  % (1218)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.75  % (1219)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.56/0.75  % (1217)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.76  % (1220)Instruction limit reached!
% 0.56/0.76  % (1220)------------------------------
% 0.56/0.76  % (1220)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.76  % (1220)Termination reason: Unknown
% 0.56/0.76  % (1220)Termination phase: Saturation
% 0.56/0.76  
% 0.56/0.76  % (1220)Memory used [KB]: 1246
% 0.56/0.76  % (1220)Time elapsed: 0.017 s
% 0.56/0.76  % (1220)Instructions burned: 56 (million)
% 0.56/0.76  % (1220)------------------------------
% 0.56/0.76  % (1220)------------------------------
% 0.56/0.76  % (1213)First to succeed.
% 0.56/0.76  % (1213)Refutation found. Thanks to Tanya!
% 0.56/0.76  % SZS status Unsatisfiable for Vampire---4
% 0.56/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.77  % (1213)------------------------------
% 0.56/0.77  % (1213)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.77  % (1213)Termination reason: Refutation
% 0.56/0.77  
% 0.56/0.77  % (1213)Memory used [KB]: 1163
% 0.56/0.77  % (1213)Time elapsed: 0.017 s
% 0.56/0.77  % (1213)Instructions burned: 28 (million)
% 0.56/0.77  % (1213)------------------------------
% 0.56/0.77  % (1213)------------------------------
% 0.56/0.77  % (1097)Success in time 0.401 s
% 0.56/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------