↑ 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  : SWV573_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n008.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 01:26:03 PM UTC 2026

% Result   : Theorem 0.19s 0.30s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  16 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :   26 (  26 usr;   4 con; 0-4 aty)
%            Number of variables   :   11 (  11   !;   0   ?;  11   :)

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

tff(type_def_6,type,
    bool: $tType ).

tff(type_def_7,type,
    int: $tType ).

tff(type_def_8,type,
    nat: $tType ).

tff(type_def_9,type,
    real: $tType ).

tff(type_def_10,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    im: complex1 > real ).

tff(func_def_1,type,
    re: complex1 > real ).

tff(func_def_2,type,
    complex: ( real * real ) > complex1 ).

tff(func_def_3,type,
    complex_case: 
      !>[X0: $tType] : ( ( fun(real,fun(real,X0)) * complex1 ) > X0 ) ).

tff(func_def_4,type,
    complex_rec: 
      !>[X0: $tType] : ( ( fun(real,fun(real,X0)) * complex1 ) > X0 ) ).

tff(func_def_5,type,
    complex_size: complex1 > nat ).

tff(func_def_6,type,
    ii: complex1 ).

tff(func_def_7,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_8,type,
    if: 
      !>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).

tff(func_def_9,type,
    semiring_1_of_nat: 
      !>[X0: $tType] : ( nat > X0 ) ).

tff(func_def_10,type,
    semiri532925092at_aux: 
      !>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).

tff(func_def_11,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

tff(func_def_12,type,
    norm_norm: 
      !>[X0: $tType] : ( X0 > real ) ).

tff(func_def_13,type,
    of_real: 
      !>[X0: $tType] : ( real > X0 ) ).

tff(func_def_14,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_15,type,
    fFalse: bool ).

tff(func_def_16,type,
    fTrue: bool ).

tff(func_def_17,type,
    n: nat ).

tff(func_def_18,type,
    sK0: complex1 > real ).

tff(func_def_19,type,
    sK1: complex1 > real ).

tff(func_def_20,type,
    sK2: fun(int,bool) > int ).

tff(func_def_21,type,
    sK3: fun(int,bool) > nat ).

tff(func_def_22,type,
    sK4: fun(int,bool) > int ).

tff(func_def_23,type,
    sK5: fun(int,bool) > nat ).

tff(func_def_24,type,
    sK6: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(pred_def_1,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    ord: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    semiring_char_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    linordered_semidom: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    real_algebra_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    real_normed_vector: 
      !>[X0: $tType] : $o ).

tff(pred_def_11,type,
    real_n2089651433ebra_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_12,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_13,type,
    ord_less_eq: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_14,type,
    pp: bool > $o ).

tff(f5,axiom,
    ! [X0: nat] : ( re(semiring_1_of_nat(complex1,X0)) = semiring_1_of_nat(real,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_complex__Re__of__nat) ).

tff(f8,axiom,
    ! [X0: nat] : ( im(semiring_1_of_nat(complex1,X0)) = zero_zero(real) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_complex__Im__of__nat) ).

tff(f25,axiom,
    ! [X0: complex1] : ( complex(re(X0),im(X0)) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24_complex__surj) ).

tff(f28,axiom,
    ! [X0: real] : ( of_real(complex1,X0) = complex(X0,zero_zero(real)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_27_complex__of__real__def) ).

tff(f145,conjecture,
    semiring_1_of_nat(complex1,n) = complex(semiring_1_of_nat(real,n),zero_zero(real)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f146,negated_conjecture,
    ( ( ~ semiring_1_of_nat(complex1,n) ) = complex(semiring_1_of_nat(real,n),zero_zero(real)) ),
    inference(negated_conjecture,[status(cth)],[f145]) ).

tff(f149,plain,
    semiring_1_of_nat(complex1,n) != complex(semiring_1_of_nat(real,n),zero_zero(real)),
    inference(flattening,[],[f146]) ).

tff(f215,plain,
    ! [X0: nat] : ( re(semiring_1_of_nat(complex1,X0)) = semiring_1_of_nat(real,X0) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f218,plain,
    ! [X0: nat] : ( im(semiring_1_of_nat(complex1,X0)) = zero_zero(real) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f244,plain,
    ! [X0: complex1] : ( complex(re(X0),im(X0)) = X0 ),
    inference(cnf_transformation,[],[f25]) ).

tff(f247,plain,
    ! [X0: real] : ( of_real(complex1,X0) = complex(X0,zero_zero(real)) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f396,plain,
    semiring_1_of_nat(complex1,n) != complex(semiring_1_of_nat(real,n),zero_zero(real)),
    inference(cnf_transformation,[],[f149]) ).

tff(f463,plain,
    ! [X0: nat] : ( semiring_1_of_nat(complex1,X0) = complex(re(semiring_1_of_nat(complex1,X0)),zero_zero(real)) ),
    inference(superposition,[],[f244,f218]) ).

tff(f466,plain,
    ! [X0: nat] : ( semiring_1_of_nat(complex1,X0) = of_real(complex1,re(semiring_1_of_nat(complex1,X0))) ),
    inference(forward_demodulation,[],[f463,f247]) ).

tff(f470,plain,
    ! [X0: nat] : ( semiring_1_of_nat(complex1,X0) = of_real(complex1,semiring_1_of_nat(real,X0)) ),
    inference(forward_demodulation,[],[f466,f215]) ).

tff(f494,plain,
    semiring_1_of_nat(complex1,n) != of_real(complex1,semiring_1_of_nat(real,n)),
    inference(superposition,[],[f396,f247]) ).

tff(f495,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f494,f470]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV573_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n008.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 11:55:40 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.19/0.30  % (2197875)Will run a generic schedule for satisfiability detection.
% 0.19/0.30  % (2197880)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1502439611_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30  % Exception at run slice level
% 0.19/0.30  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.30  % (2197881)% WARNING: option uhcvi not known.
% 0.19/0.30  % (2197881)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=297755156:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30  % (2197883)dis+10_1_sil=32000:sp=arity:random_seed=937832293:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30  % (2197882)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2045829647:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30  % (2197886)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1123007284:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30  % (2197884)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1476468262:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30  % (2197885)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1381533359:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30  % (2197888)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=797524913:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.30  % Exception at run slice level
% 0.19/0.30  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.30  % (2197884) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2197875-2197884"...
% 0.19/0.30  % (2197884)...printing done.
% 0.19/0.30  % (2197884)Refutation found. Thanks to Tanya!
% 0.19/0.30  % SZS status Theorem for theBenchmark
% 0.19/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.30  % (2197884)------------------------------
% 0.19/0.30  % (2197884)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30  % (2197884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30  % (2197884)CaDiCaL version: 2.1.3
% 0.19/0.30  % (2197884)Termination reason: Refutation
% 0.19/0.30  % (2197884)Time elapsed: 0.009 s
% 0.19/0.30  % (2197884)Peak memory usage: 12 MB
% 0.19/0.30  % (2197884)Instructions burned: 14 (million)
% 0.19/0.30  % (2197875)Success in time 0.059 s
% 0.19/0.30  % Vampire exiting
%------------------------------------------------------------------------------