%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM703^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 : Wed Sep 30 08:19:21 AM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 18 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 85 ( 9 ~; 4 |; 0 &; 69 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
y: nat ).
thf(func_def_2,type,
more: nat > nat > $o ).
thf(func_def_3,type,
suc: nat > nat ).
thf(func_def_5,type,
moreis: nat > nat > $o ).
thf(func_def_6,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
n_1: nat ).
thf(f1,axiom,
more @ ( suc @ y ) @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: nat,X1: nat] :
( ( more @ ( pl @ X1 @ n_1 ) @ X0 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz26b) ).
thf(f3,axiom,
! [X0: nat] :
( ( suc @ X0 )
= ( pl @ X0 @ n_1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4e) ).
thf(f4,conjecture,
moreis @ y @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz26c) ).
thf(f5,negated_conjecture,
~ ( moreis @ y @ x ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
more @ ( suc @ y ) @ x,
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( more @ ( suc @ y ) @ x )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: nat,X1: nat] :
( ( more @ ( pl @ X1 @ n_1 ) @ X0 )
=> ( moreis @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
! [X0: nat,X1: nat] :
( ( ( more @ ( pl @ X1 @ n_1 ) @ X0 )
= $true )
=> ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
~ ( moreis @ y @ x ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
( ( moreis @ y @ x )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( ( moreis @ y @ x )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X1 @ X0 )
= $true )
| ( ( more @ ( pl @ X1 @ n_1 ) @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f14,plain,
( ( more @ ( suc @ y ) @ x )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X1 @ X0 )
= $true )
| ( ( more @ ( pl @ X1 @ n_1 ) @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
! [X0: nat] :
( ( suc @ X0 )
= ( pl @ X0 @ n_1 ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f17,plain,
( ( moreis @ y @ x )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f65,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( more @ ( suc @ X1 ) @ X0 ) )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(forward_demodulation,[],[f15,f16]) ).
thf(f73,plain,
( ( $true != $true )
| ( ( moreis @ y @ x )
= $true ) ),
inference(constrained_superposition,[],[f65,f14]) ).
thf(f74,plain,
( ( moreis @ y @ x )
= $true ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f76,plain,
$false,
inference(forward_subsumption_resolution,[],[f74,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM703^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 12:41:36 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.19/0.26 % (658726)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (658733)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1230334329:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.26 % (658733) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-658726-658733"...
% 0.19/0.26 % (658733)...printing done.
% 0.19/0.26 % (658733)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (658733)------------------------------
% 0.19/0.26 % (658733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (658733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (658733)CaDiCaL version: 2.1.3
% 0.19/0.26 % (658733)Termination reason: Refutation
% 0.19/0.26 % (658733)Time elapsed: 0.002 s
% 0.19/0.26 % (658733)Peak memory usage: 12 MB
% 0.19/0.26 % (658733)Instructions burned: 2 (million)
% 0.19/0.26 % (658726)Success in time 0.035 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------