↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n014.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 12:25:39 PM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   52 (  17 unt;   0 typ;   2 def)
%            Number of atoms       :  113 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  114 (  53   ~;  50   |;   0   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   82 (   0 sgn  82   !;   0   ?;  82   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    frac: $tType ).

tff(func_def_0,type,
    x: frac ).

tff(func_def_1,type,
    y: frac ).

tff(func_def_2,type,
    z: frac ).

tff(func_def_3,type,
    u: frac ).

tff(func_def_4,type,
    pf: ( frac * frac ) > frac ).

tff(pred_def_1,type,
    moref: ( frac * frac ) > $o ).

tff(pred_def_2,type,
    eq: ( frac * frac ) > $o ).

tff(f1,axiom,
    moref(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

tff(f2,axiom,
    ( ~ moref(z,u)
   => eq(z,u) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).

tff(f4,axiom,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(X0,X1)
     => ( eq(X0,X2)
       => ( eq(X1,X3)
         => moref(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).

tff(f5,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( moref(X0,X1)
     => moref(pf(X0,X2),pf(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz61) ).

tff(f6,axiom,
    ! [X0: frac] : eq(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz37) ).

tff(f7,axiom,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( eq(X0,X1)
     => ( eq(X2,X3)
       => eq(pf(X0,X2),pf(X1,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz56) ).

tff(f8,axiom,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(X0,X1)
     => ( moref(X2,X3)
       => moref(pf(X0,X2),pf(X1,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz64) ).

tff(f9,conjecture,
    moref(pf(x,z),pf(y,u)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz65b) ).

tff(f10,negated_conjecture,
    ~ moref(pf(x,z),pf(y,u)),
    inference(negated_conjecture,[status(cth)],[f9]) ).

tff(f13,plain,
    ~ moref(pf(x,z),pf(y,u)),
    inference(flattening,[],[f10]) ).

tff(f14,plain,
    ( eq(z,u)
    | moref(z,u) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f16,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(X2,X3)
      | ~ eq(X1,X3)
      | ~ eq(X0,X2)
      | ~ moref(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f17,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(X2,X3)
      | ~ eq(X1,X3)
      | ~ eq(X0,X2)
      | ~ moref(X0,X1) ),
    inference(flattening,[],[f16]) ).

tff(f18,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( moref(pf(X0,X2),pf(X1,X2))
      | ~ moref(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f19,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( eq(pf(X0,X2),pf(X1,X3))
      | ~ eq(X2,X3)
      | ~ eq(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f20,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( eq(pf(X0,X2),pf(X1,X3))
      | ~ eq(X2,X3)
      | ~ eq(X0,X1) ),
    inference(flattening,[],[f19]) ).

tff(f21,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ moref(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f22,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ moref(X0,X1) ),
    inference(flattening,[],[f21]) ).

tff(f23,plain,
    moref(x,y),
    inference(cnf_transformation,[],[f1]) ).

tff(f24,plain,
    ( moref(z,u)
    | eq(z,u) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f25,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( ~ moref(X0,X1)
      | ~ eq(X0,X2)
      | ~ eq(X1,X3)
      | moref(X2,X3) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f26,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ~ moref(X0,X1)
      | moref(pf(X0,X2),pf(X1,X2)) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f27,plain,
    ! [X0: frac] : eq(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

tff(f28,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( eq(pf(X0,X2),pf(X1,X3))
      | ~ eq(X2,X3)
      | ~ eq(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f29,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( ~ moref(X0,X1)
      | ~ moref(X2,X3)
      | moref(pf(X0,X2),pf(X1,X3)) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f30,plain,
    ~ moref(pf(x,z),pf(y,u)),
    inference(cnf_transformation,[],[f13]) ).

tff(f31,plain,
    ~ moref(x,y),
    inference(consistent_polarity_flipping,[],[f23]) ).

tff(f32,plain,
    ( ~ moref(z,u)
    | eq(z,u) ),
    inference(consistent_polarity_flipping,[],[f24]) ).

tff(f33,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( ~ eq(X1,X3)
      | ~ eq(X0,X2)
      | moref(X0,X1)
      | ~ moref(X2,X3) ),
    inference(consistent_polarity_flipping,[],[f25]) ).

tff(f34,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ~ moref(pf(X0,X2),pf(X1,X2))
      | moref(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f26]) ).

tff(f35,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( ~ moref(pf(X0,X2),pf(X1,X3))
      | moref(X2,X3)
      | moref(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f29]) ).

tff(f36,plain,
    moref(pf(x,z),pf(y,u)),
    inference(consistent_polarity_flipping,[],[f30]) ).

tff(f38,definition,
    ( spl0_1
  <=> eq(z,u) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f40,plain,
    ( eq(z,u)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f38]) ).

tff(f42,definition,
    ( spl0_2
  <=> moref(z,u) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f45,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f32,f42,f38]) ).

tff(f47,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac,X4: frac,X5: frac] :
      ( ~ moref(X5,pf(X3,X1))
      | ~ eq(X2,X3)
      | ~ eq(X4,X5)
      | moref(X4,pf(X2,X0))
      | ~ eq(X0,X1) ),
    inference(resolution,[],[f28,f33]) ).

tff(f50,plain,
    ( moref(z,u)
    | moref(x,y) ),
    inference(resolution,[],[f35,f36]) ).

tff(f54,plain,
    moref(z,u),
    inference(forward_subsumption_resolution,[],[f50,f31]) ).

tff(f55,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f54,f42]) ).

tff(f59,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ~ eq(X0,y)
      | ~ eq(X1,pf(x,z))
      | moref(X1,pf(X0,X2))
      | ~ eq(X2,u) ),
    inference(resolution,[],[f47,f36]) ).

tff(f60,plain,
    ! [X0: frac,X1: frac] :
      ( ~ eq(X1,u)
      | moref(X0,pf(y,X1))
      | ~ eq(X0,pf(x,z)) ),
    inference(resolution,[],[f59,f27]) ).

tff(f64,plain,
    ( ! [X0: frac] :
        ( ~ eq(X0,pf(x,z))
        | moref(X0,pf(y,z)) )
    | ~ spl0_1 ),
    inference(resolution,[],[f60,f40]) ).

tff(f68,plain,
    ( moref(pf(x,z),pf(y,z))
    | ~ spl0_1 ),
    inference(resolution,[],[f64,f27]) ).

tff(f70,plain,
    ( moref(x,y)
    | ~ spl0_1 ),
    inference(resolution,[],[f68,f34]) ).

tff(f74,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f70,f31]) ).

tff(f75,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f74]) ).

cnf(s1,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f45]) ).

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

cnf(s4,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f75]) ).

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

tff(f76,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM762_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  % Computer : n014.cluster.edu
% 0.10/0.40  % Model    : x86_64 x86_64
% 0.10/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40  % Memory   : 8046.5625MB
% 0.10/0.40  % OS       : Linux 6.8.0-71-generic
% 0.10/0.40  % CPULimit : 300
% 0.10/0.40  % WCLimit  : 300
% 0.10/0.40  % DateTime : Sun Sep 27 21:19:47 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43  Running first-order model finding
% 0.10/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.47  % (1180649)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (1180655)% WARNING: option uhcvi not known.
% 0.17/0.47  % (1180655)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4046382118:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (1180655) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1180649-1180655"...
% 0.17/0.47  % (1180655)...printing done.
% 0.17/0.47  % (1180655)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (1180655)------------------------------
% 0.17/0.47  % (1180655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (1180655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (1180655)CaDiCaL version: 2.1.3
% 0.17/0.47  % (1180655)Termination reason: Refutation
% 0.17/0.47  % (1180655)Time elapsed: 0.002 s
% 0.17/0.47  % (1180655)Peak memory usage: 12 MB
% 0.17/0.47  % (1180655)Instructions burned: 3 (million)
% 0.17/0.47  % (1180649)Success in time 0.027 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------