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

% Computer : n001.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:19:24 AM UTC 2026

% Result   : Theorem 0.26s 0.32s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   51 (  15 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  219 (   5   ~;   0   |;   0   &; 214   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :    8 (   0   ^;   8   !;   0   ?;   8   :)

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

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

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

thf(func_def_0,type,
    x: frac ).

thf(func_def_1,type,
    y: frac ).

thf(func_def_2,type,
    orec3: $o > $o > $o > $o ).

thf(func_def_3,type,
    ts: nat > nat > nat ).

thf(func_def_4,type,
    c1x: frac > nat ).

thf(func_def_5,type,
    c2y: frac > nat ).

thf(func_def_6,type,
    c1y: frac > nat ).

thf(func_def_7,type,
    c2x: frac > nat ).

thf(func_def_8,type,
    more: nat > nat > $o ).

thf(func_def_9,type,
    less: nat > nat > $o ).

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

thf(f1,axiom,
    ! [X0: nat,X1: nat] : ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10) ).

thf(f2,conjecture,
    ( orec3
    @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
      = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
    @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
    @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41) ).

thf(f3,negated_conjecture,
    ~ ( orec3
      @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
        = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ! [X0: nat,X1: nat] : ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) ),
    inference(rectify,[],[f1]) ).

thf(f5,plain,
    ! [X0: nat,X1: nat] :
      ( ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
      = $true ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ( orec3
      @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
        = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ( $true
   != ( orec3
      @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
        = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ( $true
   != ( orec3
      @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
        = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
    inference(flattening,[],[f7]) ).

thf(f9,plain,
    ! [X0: nat,X1: nat] :
      ( ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
      = $true ),
    inference(cnf_transformation,[],[f5]) ).

thf(f10,plain,
    ( $true
   != ( orec3
      @ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
        = ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
      @ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f53,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f10,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM730^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  % Computer : n001.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 12:52:05 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.28  Running first-order model finding
% 0.09/0.28  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.26/0.32  % (1185035)Will run a generic schedule for satisfiability detection.
% 0.26/0.32  % (1185041)% WARNING: option uhcvi not known.
% 0.26/0.32  % (1185041)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4231950258:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.26/0.32  % (1185041)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.26/0.32  % (1185041)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.26/0.32  % (1185041) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1185035-1185041"...
% 0.26/0.32  % (1185041)...printing done.
% 0.26/0.32  % (1185040)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2800640284_2999 on theBenchmark for (2999ds/0Mi)
% 0.26/0.32  % (1185041)Refutation found. Thanks to Tanya!
% 0.26/0.32  % SZS status Theorem for theBenchmark
% 0.26/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.32  % (1185041)------------------------------
% 0.26/0.32  % (1185041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.32  % (1185041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.32  % (1185041)CaDiCaL version: 2.1.3
% 0.26/0.32  % (1185041)Termination reason: Refutation
% 0.26/0.32  % (1185041)Time elapsed: 0.003 s
% 0.26/0.32  % (1185041)Peak memory usage: 12 MB
% 0.26/0.32  % (1185041)Instructions burned: 4 (million)
% 0.26/0.32  % (1185035)Success in time 0.026 s
% 0.26/0.32  % Vampire exiting
%------------------------------------------------------------------------------