TSTP Solution File: LCL321-3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL321-3 : TPTP v8.2.0. Released v2.3.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 : 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 : Tue May 21 00:14:12 EDT 2024

% Result   : Unsatisfiable 0.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   31 (  20 unt;   1 typ;   0 def)
%            Number of atoms       :  156 (   1 equ)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :   34 (  21   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  113 ( 113 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   3 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   40 (  39   !;   0   ?;  40   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_3,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f118,plain,
    $false,
    inference(resolution,[],[f106,f68]) ).

tff(f68,plain,
    ~ theorem(or(q,not(q))),
    inference(forward_literal_rewriting,[],[f64,f24]) ).

tff(f24,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(X1,X0)) ),
    inference(resolution,[],[f21,f13]) ).

tff(f13,plain,
    ! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

tff(f6,axiom,
    ! [X3: $i,X4: $i] : ( implies(X3,X4) = or(not(X3),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

tff(f3,axiom,
    ! [X0: $i,X1: $i] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

tff(f21,plain,
    ! [X0: $i,X1: $i] :
      ( ~ axiom(or(not(X0),X1))
      | theorem(X1)
      | ~ theorem(X0) ),
    inference(resolution,[],[f16,f7]) ).

tff(f7,axiom,
    ! [X3: $i] :
      ( theorem(X3)
      | ~ axiom(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

tff(f16,plain,
    ! [X3: $i,X4: $i] :
      ( ~ theorem(or(not(X4),X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    inference(definition_unfolding,[],[f8,f6]) ).

tff(f8,axiom,
    ! [X3: $i,X4: $i] :
      ( ~ theorem(X4)
      | ~ theorem(implies(X4,X3))
      | theorem(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

tff(f64,plain,
    ~ theorem(or(not(q),q)),
    inference(resolution,[],[f51,f22]) ).

tff(f22,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f21,f14]) ).

tff(f14,plain,
    ! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

tff(f2,axiom,
    ! [X0: $i,X1: $i] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

tff(f51,plain,
    ~ theorem(or(not(p),or(not(q),q))),
    inference(forward_literal_rewriting,[],[f50,f25]) ).

tff(f25,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X1,or(X0,X2))) ),
    inference(resolution,[],[f21,f12]) ).

tff(f12,plain,
    ! [X2: $i,X0: $i,X1: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

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

tff(f50,plain,
    ~ theorem(or(not(q),or(not(p),q))),
    inference(forward_literal_rewriting,[],[f47,f24]) ).

tff(f47,plain,
    ~ theorem(or(or(not(p),q),not(q))),
    inference(resolution,[],[f40,f22]) ).

tff(f40,plain,
    ~ theorem(or(not(p),or(or(not(p),q),not(q)))),
    inference(resolution,[],[f25,f10]) ).

tff(f10,plain,
    ~ theorem(or(or(not(p),q),or(not(p),not(q)))),
    inference(definition_unfolding,[],[f9,f6,f6]) ).

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

tff(f106,plain,
    ! [X0: $i] : theorem(or(X0,not(X0))),
    inference(forward_literal_rewriting,[],[f105,f24]) ).

tff(f105,plain,
    ! [X0: $i] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f72,f14]) ).

tff(f72,plain,
    ! [X0: $i,X1: $i] :
      ( ~ axiom(or(X0,or(or(X0,X1),X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f42,f7]) ).

tff(f42,plain,
    ! [X0: $i,X1: $i] :
      ( ~ theorem(or(X0,or(or(X0,X1),X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f25,f23]) ).

tff(f23,plain,
    ! [X0: $i] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f21,f15]) ).

tff(f15,plain,
    ! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

tff(f1,axiom,
    ! [X0: $i] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL321-3 : TPTP v8.2.0. Released v2.3.0.
% 0.07/0.14  % 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.35  % Computer : n026.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % 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   : Mon May 20 02:07:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a CNF_UNS_RFO_SEQ_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/benchmark/theBenchmark.p
% 0.55/0.75  % (12517)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.75  % (12519)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.75  % (12521)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.75  % (12520)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.75  % (12518)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 theBenchmark for (2996ds/51Mi)
% 0.55/0.75  % (12522)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.75  % (12524)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.75  % (12523)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 theBenchmark for (2996ds/83Mi)
% 0.55/0.75  % (12520)Refutation not found, incomplete strategy% (12520)------------------------------
% 0.55/0.75  % (12520)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12522)Refutation not found, incomplete strategy% (12522)------------------------------
% 0.55/0.75  % (12522)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12522)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75  
% 0.55/0.75  % (12522)Memory used [KB]: 965
% 0.55/0.75  % (12522)Time elapsed: 0.002 s
% 0.55/0.75  % (12522)Instructions burned: 2 (million)
% 0.55/0.75  % (12520)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75  % (12521)Refutation not found, incomplete strategy% (12521)------------------------------
% 0.55/0.75  % (12521)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12521)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75  
% 0.55/0.75  % (12521)Memory used [KB]: 968
% 0.55/0.75  % (12521)Time elapsed: 0.002 s
% 0.55/0.75  % (12521)Instructions burned: 2 (million)
% 0.55/0.75  
% 0.55/0.75  % (12520)Memory used [KB]: 965
% 0.55/0.75  % (12520)Time elapsed: 0.003 s
% 0.55/0.75  % (12520)Instructions burned: 2 (million)
% 0.55/0.75  % (12524)Refutation not found, incomplete strategy% (12524)------------------------------
% 0.55/0.75  % (12524)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12524)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75  
% 0.55/0.75  % (12524)Memory used [KB]: 965
% 0.55/0.75  % (12524)Time elapsed: 0.002 s
% 0.55/0.75  % (12524)Instructions burned: 2 (million)
% 0.55/0.75  % (12523)Refutation not found, incomplete strategy% (12523)------------------------------
% 0.55/0.75  % (12523)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12522)------------------------------
% 0.55/0.75  % (12522)------------------------------
% 0.55/0.75  % (12521)------------------------------
% 0.55/0.75  % (12521)------------------------------
% 0.55/0.75  % (12523)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75  
% 0.55/0.75  % (12523)Memory used [KB]: 966
% 0.55/0.75  % (12520)------------------------------
% 0.55/0.75  % (12520)------------------------------
% 0.55/0.75  % (12523)Time elapsed: 0.003 s
% 0.55/0.75  % (12523)Instructions burned: 2 (million)
% 0.55/0.75  % (12524)------------------------------
% 0.55/0.75  % (12524)------------------------------
% 0.55/0.75  % (12523)------------------------------
% 0.55/0.75  % (12523)------------------------------
% 0.55/0.75  % (12517)First to succeed.
% 0.55/0.75  % (12517)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12493"
% 0.55/0.75  % (12518)Also succeeded, but the first one will report.
% 0.55/0.75  % (12517)Refutation found. Thanks to Tanya!
% 0.55/0.75  % SZS status Unsatisfiable for theBenchmark
% 0.55/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.75  % (12517)------------------------------
% 0.55/0.75  % (12517)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (12517)Termination reason: Refutation
% 0.55/0.75  
% 0.55/0.75  % (12517)Memory used [KB]: 1073
% 0.55/0.75  % (12517)Time elapsed: 0.004 s
% 0.55/0.75  % (12517)Instructions burned: 8 (million)
% 0.55/0.75  % (12493)Success in time 0.385 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------