↑ 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  : CSR122_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 : n013.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:45:57 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  20 unt;   0 typ;   4 def)
%            Number of atoms       :  139 (   8 equ)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   48 (  22   ~;  15   |;   7   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   81 (  81 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  11 usr;  10 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    3 (   0 sgn   3   !;   0   ?;   3   :)

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

tff(func_def_7,type,
    bG0: $o ).

tff(pred_def_1,type,
    holdsDuring_THFTYPE_IiooI: ( $i * $o ) > $o ).

tff(f1,axiom,
    likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).

tff(f2,axiom,
    likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).

tff(f3,axiom,
    ! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,$true),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).

tff(f4,conjecture,
    holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),
      ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
      & likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) )),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f5,negated_conjecture,
    ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),
        ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
        & likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) )),
    inference(negated_conjecture,[status(cth)],[f4]) ).

tff(f6,plain,
    ! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,$true),
    inference(fool_elimination,[],[f3]) ).

tff(f7,definition,
    ( ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
      & likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) )
  <=> ( $true = bG0 ) ),
    introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).

tff(f8,plain,
    ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0),
    inference(fool_elimination,[],[f5,f7]) ).

tff(f9,plain,
    ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0),
    inference(flattening,[],[f8]) ).

tff(f10,plain,
    ( ( ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
        & likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) )
      | ( $true != bG0 ) )
    & ( ( $true = bG0 )
      | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
      | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ) ),
    inference(nnf_transformation,[],[f7]) ).

tff(f11,plain,
    ( ( ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
        & likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) )
      | ( $true != bG0 ) )
    & ( ( $true = bG0 )
      | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
      | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ) ),
    inference(flattening,[],[f10]) ).

tff(f12,plain,
    ( ( $true = bG0 )
    | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
    | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f15,plain,
    likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i),
    inference(cnf_transformation,[],[f1]) ).

tff(f16,plain,
    likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i),
    inference(cnf_transformation,[],[f2]) ).

tff(f17,plain,
    ! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,$true),
    inference(cnf_transformation,[],[f6]) ).

tff(f18,plain,
    ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0),
    inference(cnf_transformation,[],[f9]) ).

tff(f22,definition,
    ( spl1_1
  <=> likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

tff(f26,definition,
    ( spl1_2
  <=> likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

tff(f30,definition,
    ( spl1_3
  <=> ( $true = bG0 ) ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

tff(f32,plain,
    ( ( $true = bG0 )
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f30]) ).

tff(f33,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f12,f30,f26,f22]) ).

tff(f36,plain,
    spl1_1,
    inference(avatar_split_clause,[],[f15,f22]) ).

tff(f37,plain,
    spl1_2,
    inference(avatar_split_clause,[],[f16,f26]) ).

tff(f38,plain,
    ( ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)
    | ~ spl1_3 ),
    inference(superposition,[],[f18,f32]) ).

tff(f39,plain,
    ( $false
    | ~ spl1_3 ),
    inference(forward_subsumption_resolution,[],[f38,f17]) ).

tff(f40,plain,
    ~ spl1_3,
    inference(avatar_contradiction_clause,[],[f39]) ).

cnf(s1,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(sat_conversion,[],[f33]) ).

cnf(s4,plain,
    spl1_1,
    inference(sat_conversion,[],[f36]) ).

cnf(s5,plain,
    spl1_2,
    inference(sat_conversion,[],[f37]) ).

cnf(s6,plain,
    ~ spl1_3,
    inference(sat_conversion,[],[f40]) ).

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

tff(f41,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR122_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.08/0.18  % Computer : n013.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 23:34:22 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.08/0.26  % (1689267)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (1689275)dis+10_1_sil=32000:sp=arity:random_seed=1103402018:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (1689275) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1689267-1689275"...
% 0.08/0.26  % (1689275)...printing done.
% 0.08/0.26  % (1689275)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (1689275)------------------------------
% 0.08/0.26  % (1689275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (1689275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (1689275)CaDiCaL version: 2.1.3
% 0.08/0.26  % (1689275)Termination reason: Refutation
% 0.08/0.26  % (1689275)Time elapsed: 0.001 s
% 0.08/0.26  % (1689275)Peak memory usage: 12 MB
% 0.08/0.26  % (1689275)Instructions burned: 1 (million)
% 0.08/0.26  % (1689267)Success in time 0.032 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------