%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM681_8 : TPTP v9.3.1. Released v8.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 12:25:20 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 79 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 47 ~; 25 |; 4 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
nat: $tType ).
tff(func_def_0,type,
x: nat ).
tff(func_def_1,type,
y: nat ).
tff(func_def_2,type,
z: nat ).
tff(func_def_3,type,
pl: ( nat * nat ) > nat ).
tff(pred_def_1,type,
less: ( nat * nat ) > $o ).
tff(pred_def_2,type,
more: ( nat * nat ) > $o ).
tff(f1,axiom,
pl(x,z) = pl(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
tff(f3,axiom,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ more(X0,X1) )
=> ~ ~ ( ( more(X0,X1)
=> ~ less(X0,X1) )
=> ~ ( less(X0,X1)
=> ( X0 != X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
tff(f4,axiom,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,X1)
=> less(pl(X0,X2),pl(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19c) ).
tff(f5,axiom,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ~ more(X0,X1)
=> less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).
tff(f6,axiom,
! [X0: nat,X1: nat,X2: nat] :
( more(X0,X1)
=> more(pl(X0,X2),pl(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19a) ).
tff(f7,conjecture,
x = y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20b) ).
tff(f8,negated_conjecture,
( ( ~ x ) = y ),
inference(negated_conjecture,[status(cth)],[f7]) ).
tff(f11,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ more(X0,X1) )
=> ( ( more(X0,X1)
=> ~ less(X0,X1) )
=> ~ ( less(X0,X1)
=> ( X0 != X1 ) ) ) ),
inference(flattening,[],[f3]) ).
tff(f12,plain,
x != y,
inference(flattening,[],[f8]) ).
tff(f14,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ~ less(X0,X1) )
& ( ~ less(X0,X1)
| ~ more(X0,X1) )
& ( ~ more(X0,X1)
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f11]) ).
tff(f15,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ~ less(X0,X1) )
& ( ~ less(X0,X1)
| ~ more(X0,X1) )
& ( ~ more(X0,X1)
| ( X0 != X1 ) ) ),
inference(flattening,[],[f14]) ).
tff(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(pl(X0,X2),pl(X1,X2))
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
tff(f17,plain,
! [X0: nat,X1: nat] :
( less(X0,X1)
| more(X0,X1)
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f18,plain,
! [X0: nat,X1: nat] :
( less(X0,X1)
| more(X0,X1)
| ( X0 = X1 ) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
! [X0: nat,X1: nat,X2: nat] :
( more(pl(X0,X2),pl(X1,X2))
| ~ more(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
tff(f20,plain,
pl(x,z) = pl(y,z),
inference(cnf_transformation,[],[f1]) ).
tff(f21,plain,
! [X0: nat,X1: nat] :
( ~ less(X0,X1)
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f15]) ).
tff(f23,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
| ~ more(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f24,plain,
! [X2: nat,X0: nat,X1: nat] :
( ~ less(X0,X1)
| less(pl(X0,X2),pl(X1,X2)) ),
inference(cnf_transformation,[],[f16]) ).
tff(f25,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| more(X0,X1)
| less(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tff(f26,plain,
! [X2: nat,X0: nat,X1: nat] :
( ~ more(X0,X1)
| more(pl(X0,X2),pl(X1,X2)) ),
inference(cnf_transformation,[],[f19]) ).
tff(f27,plain,
x != y,
inference(cnf_transformation,[],[f12]) ).
tff(f28,plain,
! [X1: nat] : ~ more(X1,X1),
inference(equality_resolution,[],[f23]) ).
tff(f29,plain,
! [X1: nat] : ~ less(X1,X1),
inference(equality_resolution,[],[f21]) ).
tff(f30,plain,
! [X1: nat] : more(X1,X1),
inference(consistent_polarity_flipping,[],[f28]) ).
tff(f32,plain,
! [X1: nat] : less(X1,X1),
inference(consistent_polarity_flipping,[],[f29]) ).
tff(f33,plain,
! [X2: nat,X0: nat,X1: nat] :
( ~ less(pl(X0,X2),pl(X1,X2))
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f24]) ).
tff(f34,plain,
! [X0: nat,X1: nat] :
( ~ more(X0,X1)
| ( X0 = X1 )
| ~ less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f25]) ).
tff(f35,plain,
! [X2: nat,X0: nat,X1: nat] :
( ~ more(pl(X0,X2),pl(X1,X2))
| more(X0,X1) ),
inference(consistent_polarity_flipping,[],[f26]) ).
tff(f39,plain,
! [X0: nat] :
( ~ less(pl(x,z),pl(X0,z))
| less(y,X0) ),
inference(superposition,[],[f33,f20]) ).
tff(f43,plain,
! [X0: nat] :
( ~ more(pl(x,z),pl(X0,z))
| more(y,X0) ),
inference(superposition,[],[f35,f20]) ).
tff(f45,plain,
less(y,x),
inference(resolution,[],[f39,f32]) ).
tff(f54,plain,
more(y,x),
inference(resolution,[],[f43,f30]) ).
tff(f60,plain,
( ( x = y )
| ~ less(y,x) ),
inference(resolution,[],[f54,f34]) ).
tff(f61,plain,
~ less(y,x),
inference(forward_subsumption_resolution,[],[f60,f27]) ).
tff(f62,plain,
$false,
inference(forward_subsumption_resolution,[],[f61,f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM681_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 21:04:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.10/0.44 % (1596213)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (1596219)% WARNING: option uhcvi not known.
% 0.10/0.44 % (1596219)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2498468810:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.44 % (1596219) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1596213-1596219"...
% 0.10/0.44 % (1596219)...printing done.
% 0.10/0.44 % (1596219)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1596219)------------------------------
% 0.10/0.45 % (1596219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1596219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1596219)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1596219)Termination reason: Refutation
% 0.10/0.45 % (1596219)Time elapsed: 0.002 s
% 0.10/0.45 % (1596219)Peak memory usage: 12 MB
% 0.10/0.45 % (1596219)Instructions burned: 2 (million)
% 0.10/0.45 % (1596213)Success in time 0.026 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------