↑ 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  : COM009-2 : TPTP v9.3.1. Released v3.2.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 09:40:07 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (   5 unt;   2 def)
%            Number of atoms       :   53 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  21   ~;  23   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ( c_UNITY_Ototalize(v_F,t_a) != v_F
    | ~ c_UNITY_Oall__total(v_F,t_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f2,plain,
    ( v_F != c_UNITY_Ototalize(v_F,t_a)
    | ~ c_UNITY_Oall__total(v_F,t_a) ),
    inference(reorient_equations,[],[f1]) ).

fof(f3,negated_conjecture,
    ( c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) = v_F ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f4,plain,
    ( c_UNITY_Oall__total(v_F,t_a)
    | v_F = c_UNITY_Ototalize(v_F,t_a) ),
    inference(reorient_equations,[],[f3]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( ~ c_UNITY_Oall__total(X0,X1)
      | c_UNITY_Ototalize(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Oall__total__imp__totalize_0) ).

fof(f6,axiom,
    ! [X0,X1] : c_UNITY_Oall__total(c_UNITY_Ototalize(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Oall__total__totalize_0) ).

fof(f8,definition,
    ( spl0_1
  <=> v_F = c_UNITY_Ototalize(v_F,t_a) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f9,plain,
    ( v_F != c_UNITY_Ototalize(v_F,t_a)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f10,plain,
    ( v_F = c_UNITY_Ototalize(v_F,t_a)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f12,definition,
    ( spl0_2
  <=> c_UNITY_Oall__total(v_F,t_a) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f13,plain,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f14,plain,
    ( c_UNITY_Oall__total(v_F,t_a)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f15,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f4,f12,f8]) ).

fof(f16,plain,
    ( ~ spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f2,f8,f12]) ).

fof(f17,plain,
    ( v_F = c_UNITY_Ototalize(v_F,t_a)
    | ~ spl0_2 ),
    inference(resolution,[],[f5,f14]) ).

fof(f19,plain,
    ( $false
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f17,f9]) ).

fof(f20,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f19]) ).

fof(f21,plain,
    ( c_UNITY_Oall__total(v_F,t_a)
    | ~ spl0_1 ),
    inference(superposition,[],[f6,f10]) ).

fof(f22,plain,
    ( $false
    | ~ spl0_1
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f21,f13]) ).

fof(f23,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_contradiction_clause,[],[f22]) ).

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

cnf(s2,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f16]) ).

cnf(s3,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f20]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f23]) ).

cnf(s5,plain,
    spl0_1,
    inference(rat,[],[s1,s3]) ).

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

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

fof(f24,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM009-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n018.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 21:46:25 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.09/0.25  % (3824596)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (3824604)dis+10_1_sil=32000:sp=arity:random_seed=576460746:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25  % (3824604) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3824596-3824604"...
% 0.09/0.25  % (3824604)...printing done.
% 0.09/0.25  % (3824604)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (3824604)------------------------------
% 0.09/0.25  % (3824604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (3824604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (3824604)CaDiCaL version: 2.1.3
% 0.09/0.25  % (3824604)Termination reason: Refutation
% 0.09/0.25  % (3824604)Time elapsed: 0.001 s
% 0.09/0.25  % (3824604)Peak memory usage: 12 MB
% 0.09/0.25  % (3824604)Instructions burned: 1 (million)
% 0.09/0.25  % (3824596)Success in time 0.024 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------