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

% Computer : n012.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 : Wed Sep 30 08:11:08 AM UTC 2026

% Result   : Theorem 0.08s 0.16s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   13 (  12 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   93 (   5   ~;   0   |;   0   &;  88   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   44 (  42 usr;   4 con; 0-4 aty)
%            Number of variables   :   16 (   0   ^;  16   !;   0   ?;  16   :)

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

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    syntax_ac_operator: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).

thf(func_def_1,type,
    syntax7388354845996824322omatch: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).

thf(func_def_2,type,
    syntax2379306206330768139omatch: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).

thf(func_def_3,type,
    a2: a ).

thf(func_def_4,type,
    b: a ).

thf(func_def_5,type,
    c: a ).

thf(func_def_6,type,
    f: a > a > a ).

thf(func_def_10,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_11,type,
    vAND: $o > $o > $o ).

thf(func_def_12,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_13,type,
    db3: 
      !>[X0: $tType] : X0 ).

thf(func_def_14,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_15,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_16,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_17,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_18,type,
    sK0: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_19,type,
    sK1: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_20,type,
    sK2: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_21,type,
    sK3: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_22,type,
    sK4: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_23,type,
    vNOT: $o > $o ).

thf(func_def_24,type,
    sK5: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_25,type,
    sK6: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_26,type,
    sK7: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_27,type,
    sK8: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_28,type,
    sK9: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_29,type,
    sK10: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_30,type,
    sK11: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_31,type,
    sK12: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_32,type,
    sK13: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_33,type,
    sK14: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_34,type,
    sK15: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_35,type,
    sK16: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_36,type,
    sK17: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_37,type,
    sK18: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_38,type,
    sK19: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_39,type,
    sK20: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_40,type,
    sK21: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_41,type,
    sK22: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_42,type,
    sK23: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(func_def_43,type,
    sK24: 
      !>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).

thf(f2,axiom,
    ! [X0: a,X1: a] :
      ( ( f @ X0 @ X1 )
      = ( f @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).

thf(f3,axiom,
    ! [X0: a,X1: a,X2: a] :
      ( ( f @ X0 @ ( f @ X1 @ X2 ) )
      = ( f @ X1 @ ( f @ X0 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_left__commute) ).

thf(f4,axiom,
    ! [X0: a,X1: a,X2: a] :
      ( ( f @ ( f @ X0 @ X1 ) @ X2 )
      = ( f @ X0 @ ( f @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_right__assoc) ).

thf(f13,conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
    = ( f @ ( f @ a2 @ c ) @ b ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(f14,negated_conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(negated_conjecture,[status(cth)],[f13]) ).

thf(f31,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(flattening,[],[f14]) ).

thf(f41,plain,
    ! [X0: a,X1: a] :
      ( ( f @ X0 @ X1 )
      = ( f @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f2]) ).

thf(f42,plain,
    ! [X2: a,X0: a,X1: a] :
      ( ( f @ X0 @ ( f @ X1 @ X2 ) )
      = ( f @ X1 @ ( f @ X0 @ X2 ) ) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f43,plain,
    ! [X2: a,X0: a,X1: a] :
      ( ( f @ X0 @ ( f @ X1 @ X2 ) )
      = ( f @ ( f @ X0 @ X1 ) @ X2 ) ),
    inference(cnf_transformation,[],[f4]) ).

thf(f52,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(cnf_transformation,[],[f31]) ).

thf(f147,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ b @ ( f @ a2 @ c ) ) ),
    inference(constrained_superposition,[],[f52,f41]) ).

thf(f148,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ a2 @ ( f @ b @ c ) ) ),
    inference(forward_demodulation,[],[f147,f42]) ).

thf(f150,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f148,f43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : ITP209^2 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Tue Sep 29 20:13:28 UTC 2026
% 0.00/0.10  % CPUTime  : 
% 0.00/0.10  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12  Running first-order model finding
% 0.08/0.12  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.16  % (631127)Will run a generic schedule for satisfiability detection.
% 0.08/0.16  % (631133)% WARNING: option uhcvi not known.
% 0.08/0.16  % (631135)dis+10_1_sil=32000:sp=arity:random_seed=1818770599:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16  % (631137)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2848485100:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16  % (631132)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1595476061_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16  % (631136)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3880105800:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16  % (631134)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=753753510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16  % (631133)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3243798027:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16  % (631138)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2005797899:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16  % (631133)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16  % (631136)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16  % Exception at run slice level
% 0.08/0.16  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.16  % (631133)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.16  % (631136) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-631127-631136"...
% 0.08/0.16  % (631137) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-631127-631137"...
% 0.08/0.16  % (631138) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-631127-631138"...
% 0.08/0.16  % (631134) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-631127-631134"...
% 0.08/0.16  % (631133) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-631127-631133"...
% 0.08/0.16  % (631137)...printing done.
% 0.08/0.16  % (631136)...printing done.
% 0.08/0.16  % (631137)Refutation found. Thanks to Tanya!
% 0.08/0.16  % SZS status Theorem for theBenchmark
% 0.08/0.16  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16  % (631137)------------------------------
% 0.08/0.16  % (631137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16  % (631137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16  % (631137)CaDiCaL version: 2.1.3
% 0.08/0.16  % (631137)Termination reason: Refutation
% 0.08/0.16  % (631137)Time elapsed: 0.003 s
% 0.08/0.16  % (631137)Peak memory usage: 11 MB
% 0.08/0.16  % (631137)Instructions burned: 10 (million)
% 0.08/0.16  % (631127)Success in time 0.028 s
% 0.08/0.16  % Vampire exiting
%------------------------------------------------------------------------------