↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:51:47 AM UTC 2026

% Result   : Unsatisfiable 6.08s 2.00s
% Output   : Refutation 6.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   30 (  13 unt;   1 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  25   ~;  21   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  56   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/sandbox/benchmark/theBenchmark.p',yql) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xhn) ).

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

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

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

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

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

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

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

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

fof(f16,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X3),X0)),equivalent(X1,X3))),
    inference(resolution,[],[f10,f6]) ).

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

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

fof(f32,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[],[f19,f8]) ).

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

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

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

fof(f44,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f32,f41]) ).

fof(f171,plain,
    ( ! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1))
    | ~ spl0_2 ),
    inference(resolution,[],[f35,f42]) ).

fof(f195,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(equivalent(equivalent(X0,X1),X0))
        | is_a_theorem(X1) )
    | ~ spl0_2 ),
    inference(resolution,[],[f171,f1]) ).

fof(f281,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(equivalent(equivalent(X0,X1),X1))
        | is_a_theorem(X0) )
    | ~ spl0_2 ),
    inference(resolution,[],[f195,f15]) ).

fof(f459,plain,
    ~ is_a_theorem(equivalent(x,equivalent(equivalent(z,x),z))),
    inference(resolution,[],[f18,f3]) ).

fof(f509,plain,
    ( ! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X1)))
    | ~ spl0_2 ),
    inference(resolution,[],[f281,f16]) ).

fof(f981,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f509,f459]) ).

fof(f1004,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f981]) ).

cnf(s2,plain,
    spl0_2,
    inference(sat_conversion,[],[f44]) ).

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f1004]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s2,s3]) ).

fof(f1005,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42  % Computer : n016.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Sun Sep 27 15:36:17 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.48  Running first-order theorem proving
% 0.17/0.48  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.08/2.00  % (2790872)Input is clausal, will run a generic CNF schedule.
% 6.08/2.00  % (2790879)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=152637701:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 6.08/2.00  % (2790880)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=84050090:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 6.08/2.00  % (2790885)dis-21_1_sil=8000:lcm=predicate:random_seed=1435545180:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 6.08/2.00  % (2790881)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=827613395:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 6.08/2.00  % (2790882)lrs+10_1_sil=8000:sp=occurrence:random_seed=1541754981:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 6.08/2.00  % (2790883)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3263273877:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 6.08/2.00  % (2790884)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3325653279:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 6.08/2.00  % (2790882)First to succeed.
% 6.08/2.00  % (2790882)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2790872"
% 6.08/2.00  % (2790883)Instruction limit reached! 
% 6.08/2.00  % (2790883)------------------------------
% 6.08/2.00  % (2790883)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790883)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790883)Termination reason: Instruction limit
% 6.08/2.00  % (2790883)Termination phase: Saturation
% 6.08/2.00  % (2790883)Time elapsed: 0.114 s
% 6.08/2.00  % (2790883)Peak memory usage: 88 MB
% 6.08/2.00  % (2790883)Instructions burned: 114 (million)
% 6.08/2.00  % (2790885)Instruction limit reached! 
% 6.08/2.00  % (2790885)------------------------------
% 6.08/2.00  % (2790885)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790885)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790885)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790885)Termination reason: Instruction limit
% 6.08/2.00  % (2790885)Termination phase: Saturation
% 6.08/2.00  % (2790885)Time elapsed: 0.120 s
% 6.08/2.00  % (2790885)Peak memory usage: 88 MB
% 6.08/2.00  % (2790885)Instructions burned: 117 (million)
% 6.08/2.00  % (2790884)Instruction limit reached! 
% 6.08/2.00  % (2790884)------------------------------
% 6.08/2.00  % (2790884)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790884)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790884)Termination reason: Instruction limit
% 6.08/2.00  % (2790884)Termination phase: Saturation
% 6.08/2.00  % (2790884)Time elapsed: 0.175 s
% 6.08/2.00  % (2790884)Peak memory usage: 89 MB
% 6.08/2.00  % (2790884)Instructions burned: 181 (million)
% 6.08/2.00  % (2790896)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4060819407:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 6.08/2.00  % (2790895)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=219298606:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 6.08/2.00  % (2790895)Refutation not found, incomplete strategy
% 6.08/2.00  % (2790895)------------------------------
% 6.08/2.00  % (2790895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790895)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790895)Termination reason: Refutation not found, incomplete strategy
% 6.08/2.00  % (2790895)Time elapsed: 0.002 s
% 6.08/2.00  % (2790895)Peak memory usage: 87 MB
% 6.08/2.00  % (2790897)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1343892358:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 6.08/2.00  % (2790897)Refutation not found, incomplete strategy
% 6.08/2.00  % (2790897)------------------------------
% 6.08/2.00  % (2790897)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790897)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790897)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790897)Termination reason: Refutation not found, incomplete strategy
% 6.08/2.00  % (2790897)Time elapsed: 0.001 s
% 6.08/2.00  % (2790897)Peak memory usage: 87 MB
% 6.08/2.00  % (2790882)Refutation found. Thanks to Tanya!
% 6.08/2.00  % SZS status Unsatisfiable for theBenchmark
% 6.08/2.00  % SZS output start Proof for theBenchmark
% See solution above
% 6.08/2.00  % (2790882)------------------------------
% 6.08/2.00  % (2790882)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/2.00  % (2790882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/2.00  % (2790882)CaDiCaL version: 2.1.3
% 6.08/2.00  % (2790882)Termination reason: Refutation
% 6.08/2.00  % (2790882)Time elapsed: 0.066 s
% 6.08/2.00  % (2790882)Peak memory usage: 89 MB
% 6.08/2.00  % (2790882)Instructions burned: 61 (million)
% 6.08/2.00  % (2790882)------------------------------
% 6.08/2.00  % (2790882)------------------------------
% 6.08/2.00  % (2790872)Success in time 0.753 s
% 6.08/2.00  % Vampire exiting
%------------------------------------------------------------------------------