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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL023-1 : TPTP v8.1.2. Released v1.0.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 : Wed May  1 03:10:22 EDT 2024

% Result   : Unsatisfiable 0.57s 0.77s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  14 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   68 (  39   ~;  27   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   79 (  79   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f236,plain,
    $false,
    inference(avatar_sat_refutation,[],[f43,f57,f235]) ).

fof(f235,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f234]) ).

fof(f234,plain,
    ( $false
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f230,f61]) ).

fof(f61,plain,
    ( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0)))
    | ~ spl0_1 ),
    inference(resolution,[],[f39,f4]) ).

fof(f4,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2))) ),
    inference(resolution,[],[f2,f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.tfutaDCQer/Vampire---4.8_16680',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
    file('/export/starexec/sandbox2/tmp/tmp.tfutaDCQer/Vampire---4.8_16680',yql) ).

fof(f39,plain,
    ( ! [X1] : is_a_theorem(equivalent(X1,X1))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f38]) ).

fof(f38,plain,
    ( spl0_1
  <=> ! [X1] : is_a_theorem(equivalent(X1,X1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f230,plain,
    ( ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(b,c)))
    | ~ spl0_1 ),
    inference(resolution,[],[f223,f24]) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X2,X0),X1))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[],[f19,f1]) ).

fof(f19,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X2,X0),X1))),
    inference(resolution,[],[f9,f7]) ).

fof(f7,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
      | is_a_theorem(equivalent(equivalent(X3,X2),X0)) ),
    inference(resolution,[],[f5,f1]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0))),
    inference(resolution,[],[f4,f2]) ).

fof(f9,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3))))),
    inference(resolution,[],[f7,f5]) ).

fof(f223,plain,
    ( ~ is_a_theorem(equivalent(equivalent(equivalent(b,c),c),b))
    | ~ spl0_1 ),
    inference(resolution,[],[f212,f24]) ).

fof(f212,plain,
    ( ~ is_a_theorem(equivalent(equivalent(b,equivalent(b,c)),c))
    | ~ spl0_1 ),
    inference(resolution,[],[f205,f69]) ).

fof(f69,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(equivalent(X1,X0))
        | ~ is_a_theorem(equivalent(X0,X1)) )
    | ~ spl0_1 ),
    inference(resolution,[],[f61,f1]) ).

fof(f205,plain,
    ( ~ is_a_theorem(equivalent(c,equivalent(b,equivalent(b,c))))
    | ~ spl0_1 ),
    inference(resolution,[],[f195,f39]) ).

fof(f195,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(X0,c))
      | ~ is_a_theorem(equivalent(X0,equivalent(b,equivalent(b,c)))) ),
    inference(resolution,[],[f60,f95]) ).

fof(f95,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(X0,equivalent(b,c)),equivalent(a,X0)))),
    inference(resolution,[],[f81,f8]) ).

fof(f8,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[],[f7,f2]) ).

fof(f81,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c)),equivalent(equivalent(X3,X2),X0)))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1)))) ),
    inference(resolution,[],[f32,f3]) ).

fof(f3,axiom,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
    file('/export/starexec/sandbox2/tmp/tmp.tfutaDCQer/Vampire---4.8_16680',prove_ec_2) ).

fof(f32,plain,
    ! [X2,X3,X0,X1,X4] :
      ( is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X4,X2),equivalent(X1,X4))))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X3))) ),
    inference(resolution,[],[f15,f1]) ).

fof(f15,plain,
    ! [X2,X3,X0,X1,X4] :
      ( is_a_theorem(equivalent(equivalent(X3,equivalent(equivalent(X4,X2),equivalent(X1,X4))),X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X3))) ),
    inference(resolution,[],[f6,f1]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(X3,equivalent(equivalent(X4,X2),equivalent(X1,X4))),X0))),
    inference(resolution,[],[f5,f4]) ).

fof(f60,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X2,X3)))
      | ~ is_a_theorem(equivalent(X0,X2))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f21,f1]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3))))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f9,f1]) ).

fof(f57,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f56]) ).

fof(f56,plain,
    ( $false
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f51,f5]) ).

fof(f51,plain,
    ( ! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))
    | ~ spl0_2 ),
    inference(resolution,[],[f42,f15]) ).

fof(f42,plain,
    ( ! [X0] : ~ is_a_theorem(equivalent(X0,X0))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f41,plain,
    ( spl0_2
  <=> ! [X0] : ~ is_a_theorem(equivalent(X0,X0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f43,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f36,f41,f38]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X0))
      | is_a_theorem(equivalent(X1,X1)) ),
    inference(resolution,[],[f28,f1]) ).

fof(f28,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
    inference(resolution,[],[f16,f7]) ).

fof(f16,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1)))),
    inference(resolution,[],[f11,f7]) ).

fof(f11,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X1,X2),X0))),
    inference(resolution,[],[f8,f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : LCL023-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.15  % 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.15/0.35  % Computer : n024.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.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Apr 30 16:36:06 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.15/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/tmp/tmp.tfutaDCQer/Vampire---4.8_16680
% 0.57/0.75  % (16910)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.57/0.75  % (16911)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.57/0.75  % (16911)Refutation not found, incomplete strategy% (16911)------------------------------
% 0.57/0.75  % (16911)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75  % (16911)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (16911)Memory used [KB]: 958
% 0.57/0.75  % (16911)Time elapsed: 0.002 s
% 0.57/0.75  % (16911)Instructions burned: 2 (million)
% 0.57/0.75  % (16911)------------------------------
% 0.57/0.75  % (16911)------------------------------
% 0.57/0.75  % (16904)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.57/0.75  % (16906)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.57/0.75  % (16907)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.57/0.75  % (16905)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.57/0.75  % (16908)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.57/0.75  % (16909)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.57/0.75  % (16909)Refutation not found, incomplete strategy% (16909)------------------------------
% 0.57/0.75  % (16909)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75  % (16909)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (16909)Memory used [KB]: 958
% 0.57/0.75  % (16908)Refutation not found, incomplete strategy% (16908)------------------------------
% 0.57/0.75  % (16908)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75  % (16908)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (16908)Memory used [KB]: 960
% 0.57/0.75  % (16908)Time elapsed: 0.004 s
% 0.57/0.75  % (16908)Instructions burned: 2 (million)
% 0.57/0.75  % (16908)------------------------------
% 0.57/0.75  % (16908)------------------------------
% 0.57/0.75  % (16909)Time elapsed: 0.004 s
% 0.57/0.75  % (16909)Instructions burned: 2 (million)
% 0.57/0.75  % (16909)------------------------------
% 0.57/0.75  % (16909)------------------------------
% 0.57/0.75  % (16913)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.57/0.76  % (16914)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.57/0.76  % (16915)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.57/0.77  % (16906)First to succeed.
% 0.57/0.77  % (16906)Refutation found. Thanks to Tanya!
% 0.57/0.77  % SZS status Unsatisfiable for Vampire---4
% 0.57/0.77  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.77  % (16906)------------------------------
% 0.57/0.77  % (16906)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.77  % (16906)Termination reason: Refutation
% 0.57/0.77  
% 0.57/0.77  % (16906)Memory used [KB]: 1099
% 0.57/0.77  % (16906)Time elapsed: 0.024 s
% 0.57/0.77  % (16906)Instructions burned: 21 (million)
% 0.57/0.77  % (16906)------------------------------
% 0.57/0.77  % (16906)------------------------------
% 0.57/0.77  % (16887)Success in time 0.409 s
% 0.57/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------