↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n009.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:50:59 AM UTC 2026

% Result   : Unsatisfiable 0.16s 1.20s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (  12 unt;   3 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   45 (  23   ~;  19   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_CAMeredith) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(implies(falsehood,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_4) ).

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

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

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

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

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

fof(f23,plain,
    ( ! [X0] : ~ is_a_theorem(X0)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f26,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(falsehood,X2)))),
    inference(resolution,[],[f9,f5]) ).

fof(f30,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f23,f2]) ).

fof(f39,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f30]) ).

fof(f64,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,implies(falsehood,X2))) ),
    inference(resolution,[],[f26,f1]) ).

fof(f69,definition,
    ( spl0_7
  <=> ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2))) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f70,plain,
    ( ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2)))
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f69]) ).

fof(f71,plain,
    ( spl0_7
    | spl0_2 ),
    inference(avatar_split_clause,[],[f64,f22,f69]) ).

fof(f72,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(falsehood,X1)) )
    | ~ spl0_7 ),
    inference(resolution,[],[f70,f1]) ).

fof(f77,definition,
    ( spl0_8
  <=> ! [X1] : is_a_theorem(implies(falsehood,X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f78,plain,
    ( ! [X1] : is_a_theorem(implies(falsehood,X1))
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f77]) ).

fof(f79,plain,
    ( spl0_8
    | spl0_2
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f72,f69,f22,f77]) ).

fof(f80,plain,
    ( $false
    | ~ spl0_8 ),
    inference(resolution,[],[f78,f3]) ).

fof(f82,plain,
    ~ spl0_8,
    inference(avatar_contradiction_clause,[],[f80]) ).

cnf(s6,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f39]) ).

cnf(s10,plain,
    ( spl0_2
    | spl0_7 ),
    inference(sat_conversion,[],[f71]) ).

cnf(s11,plain,
    ( spl0_2
    | ~ spl0_7
    | spl0_8 ),
    inference(sat_conversion,[],[f79]) ).

cnf(s12,plain,
    ~ spl0_8,
    inference(sat_conversion,[],[f82]) ).

cnf(s13,plain,
    ( spl0_2
    | ~ spl0_7 ),
    inference(rat,[],[s11,s12]) ).

cnf(s14,plain,
    ~ spl0_7,
    inference(rat,[],[s13,s6]) ).

cnf(s17,plain,
    $false,
    inference(rat,[],[s10,s14,s6]) ).

fof(f83,plain,
    $false,
    inference(avatar_sat_refutation,[],[s17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL035-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n009.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 15:18:16 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/1.20  % (2156082)Input is clausal, will run a generic CNF schedule.
% 0.16/1.20  % (2156092)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=876171594:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.16/1.20  % (2156093)dis-21_1_sil=8000:lcm=predicate:random_seed=1265656140: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)
% 0.16/1.20  % (2156090)lrs+10_1_sil=8000:sp=occurrence:random_seed=1596607100:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.16/1.20  % (2156091)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=271747798:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.16/1.20  % (2156088)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1290680469:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.16/1.20  % (2156089)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4100236327:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.16/1.20  % (2156087)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=2800529948:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.16/1.20  % (2156090)Also succeeded, but the first one will report.
% 0.16/1.20  % (2156091)First to succeed.
% 0.16/1.20  % (2156091)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2156082"
% 0.16/1.20  % (2156092)Also succeeded, but the first one will report.
% 0.16/1.20  % (2156093)Also succeeded, but the first one will report.
% 0.16/1.20  % (2156091)Refutation found. Thanks to Tanya!
% 0.16/1.20  % SZS status Unsatisfiable for theBenchmark
% 0.16/1.20  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.21  % (2156091)------------------------------
% 0.16/1.21  % (2156091)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.21  % (2156091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.21  % (2156091)CaDiCaL version: 2.1.3
% 0.16/1.21  % (2156091)Termination reason: Refutation
% 0.16/1.21  % (2156091)Time elapsed: 0.003 s
% 0.16/1.21  % (2156091)Peak memory usage: 89 MB
% 0.16/1.21  % (2156091)Instructions burned: 2 (million)
% 0.16/1.21  % (2156091)------------------------------
% 0.16/1.21  % (2156091)------------------------------
% 0.16/1.21  % (2156082)Success in time 0.397 s
% 0.16/1.21  % Vampire exiting
%------------------------------------------------------------------------------