↑ 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  : SWW488_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 : n006.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:40:19 PM UTC 2026

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

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

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

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

tff(type_def_8,type,
    poly1: $tType > $tType ).

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

tff(func_def_0,type,
    fundam296178794t_poly: 
      !>[X0: $tType] : ( ( poly1(X0) * X0 ) > poly1(X0) ) ).

tff(func_def_1,type,
    one_one: 
      !>[X0: $tType] : X0 ).

tff(func_def_2,type,
    plus_plus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

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

tff(func_def_4,type,
    ring_1_Ints: 
      !>[X0: $tType] : fun(X0,bool) ).

tff(func_def_5,type,
    coeff: 
      !>[X0: $tType] : ( poly1(X0) > fun(nat,X0) ) ).

tff(func_def_6,type,
    monom: 
      !>[X0: $tType] : ( ( X0 * nat ) > poly1(X0) ) ).

tff(func_def_7,type,
    order: 
      !>[X0: $tType] : ( ( X0 * poly1(X0) ) > nat ) ).

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

tff(func_def_9,type,
    poly: 
      !>[X0: $tType] : ( poly1(X0) > fun(X0,X0) ) ).

tff(func_def_10,type,
    poly_rec: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(poly1(X1),fun(X0,X0))) * poly1(X1) ) > X0 ) ).

tff(func_def_11,type,
    synthetic_div: 
      !>[X0: $tType] : ( ( poly1(X0) * X0 ) > poly1(X0) ) ).

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

tff(func_def_13,type,
    fFalse: bool ).

tff(func_def_14,type,
    fTrue: bool ).

tff(func_def_15,type,
    h: a ).

tff(func_def_16,type,
    x: a ).

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

tff(func_def_18,type,
    sK1: 
      !>[X0: $tType] : ( ( poly1(X0) * poly1(X0) ) > nat ) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_14,type,
    ab_semigroup_add: 
      !>[X0: $tType] : $o ).

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

tff(pred_def_16,type,
    cancel_semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_17,type,
    cancel146912293up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_18,type,
    linord219039673up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_19,type,
    ordere216010020id_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_20,type,
    ordere236663937imp_le: 
      !>[X0: $tType] : $o ).

tff(pred_def_21,type,
    ordere223160158up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_22,type,
    semiri456707255roduct: 
      !>[X0: $tType] : $o ).

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

tff(pred_def_24,type,
    member: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).

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

tff(f1,axiom,
    ! [X0: $tType] :
      ( comm_semiring_0(X0)
     => ! [X2: X0] : ( fundam296178794t_poly(X0,zero_zero(poly1(X0)),X2) = zero_zero(poly1(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_offset__poly__0) ).

tff(f2,axiom,
    ! [X0: $tType] :
      ( comm_semiring_0(X0)
     => ! [X1: X0] : ( aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) = zero_zero(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_poly__0) ).

tff(f143,conjecture,
    aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) = aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f144,negated_conjecture,
    ( ( ~ aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) ) = aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) ),
    inference(negated_conjecture,[status(cth)],[f143]) ).

tff(f145,axiom,
    comm_semiring_0(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_0) ).

tff(f146,plain,
    ! [X0: $tType] :
      ( comm_semiring_0(X0)
     => ! [X1: X0] : ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) ) ),
    inference(rectify,[],[f1]) ).

tff(f147,plain,
    aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) != aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
    inference(flattening,[],[f144]) ).

tff(f148,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) )
      | ~ comm_semiring_0(X0) ),
    inference(ennf_transformation,[],[f146]) ).

tff(f149,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ( aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) = zero_zero(X0) )
      | ~ comm_semiring_0(X0) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f264,plain,
    ! [X0: $tType,X1: X0] :
      ( ~ comm_semiring_0(X0)
      | ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) ) ),
    inference(cnf_transformation,[],[f148]) ).

tff(f265,plain,
    ! [X0: $tType,X1: X0] :
      ( ~ comm_semiring_0(X0)
      | ( aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) = zero_zero(X0) ) ),
    inference(cnf_transformation,[],[f149]) ).

tff(f435,plain,
    aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) != aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
    inference(cnf_transformation,[],[f147]) ).

tff(f436,plain,
    comm_semiring_0(a),
    inference(cnf_transformation,[],[f145]) ).

tff(f624,plain,
    ! [X0: a] : ( zero_zero(poly1(a)) = fundam296178794t_poly(a,zero_zero(poly1(a)),X0) ),
    inference(resolution,[],[f264,f436]) ).

tff(f638,plain,
    ! [X0: a] : ( zero_zero(a) = aa(a,a,poly(a,zero_zero(poly1(a))),X0) ),
    inference(resolution,[],[f265,f436]) ).

tff(f953,plain,
    aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) != aa(a,a,poly(a,zero_zero(poly1(a))),x),
    inference(superposition,[],[f435,f624]) ).

tff(f954,plain,
    aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) != zero_zero(a),
    inference(forward_demodulation,[],[f953,f638]) ).

tff(f955,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f954,f638]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW488_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n006.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.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 14:14:40 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  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  % (3990170)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (3990179)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1492946889:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (3990176)% WARNING: option uhcvi not known.
% 0.08/0.26  % (3990176)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1165286696:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (3990175)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2124319188_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % (3990177)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3746590460:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (3990178)dis+10_1_sil=32000:sp=arity:random_seed=916184747:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (3990180)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3461538699:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26  % (3990181)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2206103996:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26  % (3990179) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3990170-3990179"...
% 0.08/0.26  % Exception at run slice level
% 0.08/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.26  % (3990179)...printing done.
% 0.08/0.26  % (3990179)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.19/0.26  % (3990179)------------------------------
% 0.19/0.26  % (3990179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26  % (3990179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26  % (3990179)CaDiCaL version: 2.1.3
% 0.19/0.26  % (3990179)Termination reason: Refutation
% 0.19/0.26  % (3990179)Time elapsed: 0.011 s
% 0.19/0.26  % (3990179)Peak memory usage: 12 MB
% 0.19/0.26  % (3990179)Instructions burned: 34 (million)
% 0.19/0.26  % (3990170)Success in time 0.04 s
% 0.19/0.26  % Vampire exiting
%------------------------------------------------------------------------------