↑ 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  : SYN071-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 : n003.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.29s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (   8 unt;   4 def)
%            Number of atoms       :   75 (  18 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   78 (  41   ~;  33   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( a = b
    | c = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,axiom,
    ( a = c
    | b = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f3,negated_conjecture,
    a != d,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f4,negated_conjecture,
    b != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f6,definition,
    ( spl0_1
  <=> b = d ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f8,plain,
    ( b = d
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f6]) ).

fof(f10,definition,
    ( spl0_2
  <=> a = c ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f12,plain,
    ( a = c
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f13,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f2,f10,f6]) ).

fof(f15,definition,
    ( spl0_3
  <=> c = d ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f17,plain,
    ( c = d
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f19,definition,
    ( spl0_4
  <=> a = b ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f21,plain,
    ( a = b
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f22,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f1,f19,f15]) ).

fof(f23,plain,
    ( a = d
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_demodulation,[],[f17,f12]) ).

fof(f24,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f23,f3]) ).

fof(f25,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f24]) ).

fof(f26,plain,
    ( b = c
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_demodulation,[],[f17,f8]) ).

fof(f27,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f26,f4]) ).

fof(f28,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f27]) ).

fof(f30,plain,
    ( a != b
    | ~ spl0_2 ),
    inference(superposition,[],[f4,f12]) ).

fof(f31,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f30,f21]) ).

fof(f32,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f31]) ).

fof(f33,plain,
    ( a = d
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f8,f21]) ).

fof(f34,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f33,f3]) ).

fof(f35,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f34]) ).

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

cnf(s2,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f22]) ).

cnf(s3,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f25]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f28]) ).

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

cnf(s6,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f35]) ).

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

cnf(s8,plain,
    spl0_1,
    inference(rat,[],[s1,s7]) ).

cnf(s9,plain,
    ~ spl0_4,
    inference(rat,[],[s6,s8]) ).

cnf(s10,plain,
    ~ spl0_3,
    inference(rat,[],[s4,s8]) ).

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

fof(f36,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN071-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n003.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 15:31:34 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24  Running first-order model finding
% 0.09/0.24  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.29  % (1701210)Will run a generic schedule for satisfiability detection.
% 0.21/0.29  % (1701220)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1560038619:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29  % (1701220) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1701210-1701220"...
% 0.21/0.29  % (1701220)...printing done.
% 0.21/0.29  % (1701220)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29  % (1701220)------------------------------
% 0.21/0.29  % (1701220)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (1701220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (1701220)CaDiCaL version: 2.1.3
% 0.21/0.29  % (1701220)Termination reason: Refutation
% 0.21/0.29  % (1701220)Time elapsed: 0.001 s
% 0.21/0.29  % (1701220)Peak memory usage: 12 MB
% 0.21/0.29  % (1701220)Instructions burned: 1 (million)
% 0.21/0.29  % (1701210)Success in time 0.037 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------