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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL287-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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.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:13:57 EDT 2024

% Result   : Unsatisfiable 0.53s 0.73s
% Output   : Refutation 0.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (  25 unt;   0 def)
%            Number of atoms       :   47 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  15   ~;  11   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   50 (  50   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f78,plain,
    $false,
    inference(avatar_sat_refutation,[],[f72,f77]) ).

fof(f77,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f74]) ).

fof(f74,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f67,f46]) ).

fof(f46,plain,
    ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q))))),
    inference(resolution,[],[f42,f19]) ).

fof(f19,plain,
    ~ theorem(not(or(not(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q))))),not(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q)))))))),
    inference(definition_unfolding,[],[f11,f12,f9]) ).

fof(f9,axiom,
    ! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).

fof(f12,plain,
    ! [X6,X5] : equivalent(X5,X6) = not(or(not(or(not(X5),X6)),not(or(not(X6),X5)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

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

fof(f10,axiom,
    ! [X6,X5] : equivalent(X5,X6) = and(implies(X5,X6),implies(X6,X5)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).

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

fof(f42,plain,
    ! [X0] :
      ( theorem(not(or(not(X0),not(X0))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f28,f18]) ).

fof(f18,plain,
    ! [X3,X4] :
      ( ~ theorem(or(not(X4),X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    inference(definition_unfolding,[],[f8,f6]) ).

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

fof(f28,plain,
    ! [X0] : theorem(or(X0,not(or(X0,X0)))),
    inference(resolution,[],[f27,f20]) ).

fof(f20,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f13,f7]) ).

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

fof(f13,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

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

fof(f27,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,X1))
      | theorem(or(X1,X0)) ),
    inference(resolution,[],[f22,f18]) ).

fof(f22,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f15,f7]) ).

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

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

fof(f67,plain,
    ( ! [X1] : theorem(or(not(X1),X1))
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f66]) ).

fof(f66,plain,
    ( spl0_3
  <=> ! [X1] : theorem(or(not(X1),X1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f72,plain,
    spl0_3,
    inference(avatar_split_clause,[],[f63,f66]) ).

fof(f63,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f58,f23]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f18,f20]) ).

fof(f58,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f53,f21]) ).

fof(f21,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

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

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

fof(f53,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X2)))
      | theorem(or(X1,or(X0,X2))) ),
    inference(resolution,[],[f52,f18]) ).

fof(f52,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f16,f7]) ).

fof(f16,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : LCL287-3 : TPTP v8.2.0. Released v2.3.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34  % Computer : n024.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 00:46:53 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.34  This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.14/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.73  % (3444)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.53/0.73  % (3444)Refutation not found, incomplete strategy% (3444)------------------------------
% 0.53/0.73  % (3444)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73  % (3444)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73  
% 0.53/0.73  % (3444)Memory used [KB]: 1002
% 0.53/0.73  % (3444)Time elapsed: 0.002 s
% 0.53/0.73  % (3444)Instructions burned: 2 (million)
% 0.53/0.73  % (3444)------------------------------
% 0.53/0.73  % (3444)------------------------------
% 0.53/0.73  % (3437)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.53/0.73  % (3439)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73  % (3440)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.53/0.73  % (3438)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.53/0.73  % (3442)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.53/0.73  % (3440)Refutation not found, incomplete strategy% (3440)------------------------------
% 0.53/0.73  % (3440)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73  % (3440)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73  
% 0.53/0.73  % (3440)Memory used [KB]: 1000
% 0.53/0.73  % (3440)Time elapsed: 0.002 s
% 0.53/0.73  % (3440)Instructions burned: 2 (million)
% 0.53/0.73  % (3440)------------------------------
% 0.53/0.73  % (3440)------------------------------
% 0.53/0.73  % (3442)Refutation not found, incomplete strategy% (3442)------------------------------
% 0.53/0.73  % (3442)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73  % (3442)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73  
% 0.53/0.73  % (3442)Memory used [KB]: 1002
% 0.53/0.73  % (3442)Time elapsed: 0.003 s
% 0.53/0.73  % (3442)Instructions burned: 2 (million)
% 0.53/0.73  % (3442)------------------------------
% 0.53/0.73  % (3442)------------------------------
% 0.53/0.73  % (3438)First to succeed.
% 0.53/0.73  % (3443)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.53/0.73  % (3443)Refutation not found, incomplete strategy% (3443)------------------------------
% 0.53/0.73  % (3443)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73  % (3443)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73  
% 0.53/0.73  % (3443)Memory used [KB]: 1003
% 0.53/0.73  % (3438)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3436"
% 0.53/0.73  % (3443)Time elapsed: 0.001 s
% 0.53/0.73  % (3443)Instructions burned: 2 (million)
% 0.53/0.73  % (3443)------------------------------
% 0.53/0.73  % (3443)------------------------------
% 0.53/0.73  % (3438)Refutation found. Thanks to Tanya!
% 0.53/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.53/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.73  % (3438)------------------------------
% 0.53/0.73  % (3438)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73  % (3438)Termination reason: Refutation
% 0.53/0.73  
% 0.53/0.73  % (3438)Memory used [KB]: 1041
% 0.53/0.73  % (3438)Time elapsed: 0.004 s
% 0.53/0.73  % (3438)Instructions burned: 4 (million)
% 0.53/0.73  % (3436)Success in time 0.379 s
% 0.53/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------