↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n018.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 02:06:41 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   39 (   9 unt;   2 def)
%            Number of atoms       :   85 (  40 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   86 (  40   ~;  44   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | X0 = a ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | a = X0 ),
    inference(reorient_equations,[],[f1]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | X1 = b ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f4,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | b = X1 ),
    inference(reorient_equations,[],[f3]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( X0 != a
      | X1 != b
      | big_f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f6,plain,
    ! [X0,X1] :
      ( a != X0
      | b != X1
      | big_f(X0,X1) ),
    inference(reorient_equations,[],[f5]) ).

fof(f15,negated_conjecture,
    ! [X0,X1] :
      ( X0 != g(X1)
      | big_f(f(X1),X0)
      | f(X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f16,plain,
    ! [X0,X1] :
      ( g(X1) != X0
      | big_f(f(X1),X0)
      | f(X1) = X1 ),
    inference(reorient_equations,[],[f15]) ).

fof(f19,negated_conjecture,
    ! [X0,X1] :
      ( f(X0) != X0
      | big_f(f(X0),h(X0,X1))
      | h(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

fof(f20,negated_conjecture,
    ! [X0,X1] :
      ( h(X0,X1) != X1
      | f(X0) != X0
      | ~ big_f(f(X0),h(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f21,plain,
    ! [X1] :
      ( b != X1
      | big_f(a,X1) ),
    inference(equality_resolution,[],[f6]) ).

fof(f22,plain,
    big_f(a,b),
    inference(equality_resolution,[],[f21]) ).

fof(f24,plain,
    ! [X1] :
      ( big_f(f(X1),g(X1))
      | f(X1) = X1 ),
    inference(equality_resolution,[],[f16]) ).

fof(f31,plain,
    ! [X0] :
      ( a = f(X0)
      | f(X0) = X0 ),
    inference(resolution,[],[f2,f24]) ).

fof(f43,plain,
    ! [X0] :
      ( a != X0
      | f(X0) = X0 ),
    inference(equality_factoring,[],[f31]) ).

fof(f49,plain,
    a = f(a),
    inference(equality_resolution,[],[f43]) ).

fof(f53,plain,
    ! [X0] :
      ( a != a
      | big_f(a,h(a,X0))
      | h(a,X0) = X0 ),
    inference(superposition,[],[f19,f49]) ).

fof(f55,plain,
    ! [X0] :
      ( big_f(a,h(a,X0))
      | h(a,X0) = X0 ),
    inference(trivial_inequality_removal,[],[f53]) ).

fof(f61,definition,
    ( spl0_2
  <=> ! [X0] :
        ( big_f(a,h(a,X0))
        | h(a,X0) = X0 ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f62,plain,
    ( ! [X0] :
        ( big_f(a,h(a,X0))
        | h(a,X0) = X0 )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f61]) ).

fof(f64,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f55,f61]) ).

fof(f85,definition,
    ( spl0_4
  <=> ! [X0] :
        ( b = h(a,X0)
        | h(a,X0) = X0 ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f86,plain,
    ( ! [X0] :
        ( b = h(a,X0)
        | h(a,X0) = X0 )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f85]) ).

fof(f108,plain,
    ( ! [X0] :
        ( h(a,X0) = X0
        | b = h(a,X0) )
    | ~ spl0_2 ),
    inference(resolution,[],[f62,f4]) ).

fof(f110,plain,
    ( spl0_4
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f108,f61,f85]) ).

fof(f125,plain,
    ( ! [X0] :
        ( b != X0
        | h(a,X0) = X0 )
    | ~ spl0_4 ),
    inference(equality_factoring,[],[f86]) ).

fof(f141,plain,
    ( b = h(a,b)
    | ~ spl0_4 ),
    inference(equality_resolution,[],[f125]) ).

fof(f162,plain,
    ( b != b
    | a != f(a)
    | ~ big_f(f(a),b)
    | ~ spl0_4 ),
    inference(superposition,[],[f20,f141]) ).

fof(f165,plain,
    ( a != f(a)
    | ~ big_f(f(a),b)
    | ~ spl0_4 ),
    inference(trivial_inequality_removal,[],[f162]) ).

fof(f168,plain,
    ( ~ big_f(f(a),b)
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f165,f2]) ).

fof(f170,plain,
    ( ~ big_f(a,b)
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f168,f49]) ).

fof(f171,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f170,f22]) ).

fof(f172,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f171]) ).

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

cnf(s5,plain,
    ( ~ spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f110]) ).

cnf(s6,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f172]) ).

cnf(s7,plain,
    ~ spl0_2,
    inference(rat,[],[s5,s6]) ).

cnf(s10,plain,
    $false,
    inference(rat,[],[s2,s7]) ).

fof(f173,plain,
    $false,
    inference(avatar_sat_refutation,[],[s10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN074-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n018.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 15:34:10 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.21/0.26  % (3488349)Will run a generic schedule for satisfiability detection.
% 0.21/0.26  % (3488364)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2003946121:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.26  % (3488360)% WARNING: option uhcvi not known.
% 0.21/0.26  % (3488359)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1025043460_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.26  % (3488362)dis+10_1_sil=32000:sp=arity:random_seed=442470344:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.26  % (3488363)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=61069087:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.26  % (3488361)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=845829467:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.26  % (3488365)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3071242836:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.26  % (3488360)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1858383440:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.26  % TRYING [1]
% 0.21/0.26  % TRYING [2]
% 0.21/0.26  % TRYING [3]
% 0.21/0.26  % TRYING [4]
% 0.21/0.26  % (3488362) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3488349-3488362"...
% 0.21/0.26  % TRYING [5]
% 0.21/0.26  % (3488365) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3488349-3488365"...
% 0.21/0.26  % (3488360) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3488349-3488360"...
% 0.21/0.26  % (3488362)...printing done.
% 0.21/0.26  % (3488365)...printing done.
% 0.21/0.26  % (3488360)...printing done.
% 0.21/0.26  % (3488362)Refutation found. Thanks to Tanya!
% 0.21/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (3488362)------------------------------
% 0.21/0.27  % (3488362)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (3488362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (3488362)CaDiCaL version: 2.1.3
% 0.21/0.27  % (3488362)Termination reason: Refutation
% 0.21/0.27  % (3488362)Time elapsed: 0.005 s
% 0.21/0.27  % (3488362)Peak memory usage: 12 MB
% 0.21/0.27  % (3488362)Instructions burned: 6 (million)
% 0.21/0.27  % (3488349)Success in time 0.041 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------