↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n001.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:16 AM UTC 2026

% Result   : Unsatisfiable 2.70s 1.28s
% Output   : Refutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  14 unt;   2 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  25   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    7 (   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   :   58 (   0 sgn  58   !;   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,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',wo) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqm) ).

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

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

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

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

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

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

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

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

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

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

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

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

fof(f1328,definition,
    ( spl0_43
  <=> ! [X3] : ~ is_a_theorem(X3) ),
    introduced(definition,[new_symbols(definition,[spl0_43])],[avatar_definition]) ).

fof(f1329,plain,
    ( ! [X3] : ~ is_a_theorem(X3)
    | ~ spl0_43 ),
    inference(avatar_component_clause,[],[f1328]) ).

fof(f1582,definition,
    ( spl0_54
  <=> is_a_theorem(equivalent(equivalent(c,a),equivalent(equivalent(c,b),equivalent(a,b)))) ),
    introduced(definition,[new_symbols(definition,[spl0_54])],[avatar_definition]) ).

fof(f1583,plain,
    ( is_a_theorem(equivalent(equivalent(c,a),equivalent(equivalent(c,b),equivalent(a,b))))
    | ~ spl0_54 ),
    inference(avatar_component_clause,[],[f1582]) ).

fof(f1584,plain,
    ( ~ is_a_theorem(equivalent(equivalent(c,a),equivalent(equivalent(c,b),equivalent(a,b))))
    | spl0_54 ),
    inference(avatar_component_clause,[],[f1582]) ).

fof(f1734,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(X0)
        | ~ is_a_theorem(equivalent(equivalent(b,equivalent(a,equivalent(c,b))),equivalent(equivalent(c,a),X0))) )
    | spl0_54 ),
    inference(resolution,[],[f1584,f196]) ).

fof(f1743,plain,
    ( ! [X0] : ~ is_a_theorem(X0)
    | spl0_54 ),
    inference(forward_subsumption_resolution,[],[f1734,f15]) ).

fof(f1745,plain,
    ( spl0_43
    | spl0_54 ),
    inference(avatar_split_clause,[],[f1743,f1582,f1328]) ).

fof(f1759,plain,
    ( $false
    | ~ spl0_43 ),
    inference(resolution,[],[f1329,f31]) ).

fof(f1854,plain,
    ~ spl0_43,
    inference(avatar_contradiction_clause,[],[f1759]) ).

fof(f1874,plain,
    ( is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a))))
    | ~ spl0_54 ),
    inference(resolution,[],[f1583,f4]) ).

fof(f1877,plain,
    ( $false
    | ~ spl0_54 ),
    inference(forward_subsumption_resolution,[],[f1874,f3]) ).

fof(f1878,plain,
    ~ spl0_54,
    inference(avatar_contradiction_clause,[],[f1877]) ).

cnf(s121,plain,
    ( spl0_43
    | spl0_54 ),
    inference(sat_conversion,[],[f1745]) ).

cnf(s145,plain,
    ~ spl0_43,
    inference(sat_conversion,[],[f1854]) ).

cnf(s147,plain,
    ~ spl0_54,
    inference(sat_conversion,[],[f1878]) ).

cnf(s148,plain,
    $false,
    inference(rat,[],[s121,s147,s145]) ).

fof(f1879,plain,
    $false,
    inference(avatar_sat_refutation,[],[s148]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL118-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n001.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 15:28:45 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 2.70/1.28  % (3708468)Input is clausal, will run a generic CNF schedule.
% 2.70/1.28  % (3708558)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3731026581:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.70/1.28  % (3708558)First to succeed.
% 2.70/1.28  % (3708558)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3708468"
% 2.70/1.28  % (3708553)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=660211846:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.70/1.28  % (3708555)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1195516211:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.70/1.28  % (3708551)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=5682885:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.70/1.28  % (3708556)lrs+10_1_sil=8000:sp=occurrence:random_seed=1532192144:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.70/1.28  % (3708557)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2907784779:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.70/1.28  % (3708559)dis-21_1_sil=8000:lcm=predicate:random_seed=3276310583: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)
% 2.70/1.28  % (3708556)Instruction limit reached! 
% 2.70/1.28  % (3708556)------------------------------
% 2.70/1.28  % (3708556)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.28  % (3708556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.28  % (3708556)CaDiCaL version: 2.1.3
% 2.70/1.28  % (3708556)Termination reason: Instruction limit
% 2.70/1.28  % (3708556)Termination phase: Saturation
% 2.70/1.28  % (3708556)Time elapsed: 0.066 s
% 2.70/1.28  % (3708556)Peak memory usage: 88 MB
% 2.70/1.28  % (3708556)Instructions burned: 107 (million)
% 2.70/1.28  % (3708559)Instruction limit reached! 
% 2.70/1.28  % (3708559)------------------------------
% 2.70/1.28  % (3708559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.28  % (3708559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.28  % (3708559)CaDiCaL version: 2.1.3
% 2.70/1.28  % (3708559)Termination reason: Instruction limit
% 2.70/1.28  % (3708559)Termination phase: Saturation
% 2.70/1.28  % (3708559)Time elapsed: 0.071 s
% 2.70/1.28  % (3708559)Peak memory usage: 88 MB
% 2.70/1.28  % (3708559)Instructions burned: 117 (million)
% 2.70/1.28  % (3708557)Instruction limit reached! 
% 2.70/1.28  % (3708557)------------------------------
% 2.70/1.28  % (3708557)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.28  % (3708557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.28  % (3708557)CaDiCaL version: 2.1.3
% 2.70/1.28  % (3708557)Termination reason: Instruction limit
% 2.70/1.28  % (3708557)Termination phase: Saturation
% 2.70/1.28  % (3708557)Time elapsed: 0.122 s
% 2.70/1.28  % (3708557)Peak memory usage: 88 MB
% 2.70/1.28  % (3708557)Instructions burned: 114 (million)
% 2.70/1.28  % (3708558)Refutation found. Thanks to Tanya!
% 2.70/1.28  % SZS status Unsatisfiable for theBenchmark
% 2.70/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 2.70/1.28  % (3708558)------------------------------
% 2.70/1.28  % (3708558)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.28  % (3708558)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.28  % (3708558)CaDiCaL version: 2.1.3
% 2.70/1.28  % (3708558)Termination reason: Refutation
% 2.70/1.28  % (3708558)Time elapsed: 0.029 s
% 2.70/1.28  % (3708558)Peak memory usage: 90 MB
% 2.70/1.28  % (3708558)Instructions burned: 76 (million)
% 2.70/1.28  % (3708558)------------------------------
% 2.70/1.28  % (3708558)------------------------------
% 2.70/1.28  % (3708468)Success in time 0.316 s
% 2.70/1.28  % Vampire exiting
%------------------------------------------------------------------------------