%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM655_8 : 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 : n004.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:12 PM UTC 2026
% Result : Theorem 0.08s 0.44s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 7 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
nat: $tType ).
tff(func_def_0,type,
x: nat ).
tff(func_def_1,type,
y: nat ).
tff(pred_def_1,type,
less: ( nat * nat ) > $o ).
tff(pred_def_2,type,
more: ( nat * nat ) > $o ).
tff(f1,axiom,
~ less(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(f3,axiom,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ~ more(X0,X1)
=> less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10a) ).
tff(f4,conjecture,
( ~ more(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10f) ).
tff(f5,negated_conjecture,
~ ( ~ more(x,y)
=> ( x = y ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
tff(f9,plain,
! [X0: nat,X1: nat] :
( less(X0,X1)
| more(X0,X1)
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f10,plain,
! [X0: nat,X1: nat] :
( less(X0,X1)
| more(X0,X1)
| ( X0 = X1 ) ),
inference(flattening,[],[f9]) ).
tff(f11,plain,
( ( x != y )
& ~ more(x,y) ),
inference(ennf_transformation,[],[f5]) ).
tff(f12,plain,
~ less(x,y),
inference(cnf_transformation,[],[f1]) ).
tff(f13,plain,
! [X0: nat,X1: nat] :
( more(X0,X1)
| ( X0 = X1 )
| less(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tff(f14,plain,
~ more(x,y),
inference(cnf_transformation,[],[f11]) ).
tff(f15,plain,
x != y,
inference(cnf_transformation,[],[f11]) ).
tff(f16,plain,
( ( x = y )
| less(x,y) ),
inference(resolution,[],[f13,f14]) ).
tff(f17,plain,
less(x,y),
inference(forward_subsumption_resolution,[],[f16,f15]) ).
tff(f18,plain,
$false,
inference(forward_subsumption_resolution,[],[f17,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM655_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 20:58:07 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.40 Running first-order model finding
% 0.08/0.40 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.44 % (3872623)Will run a generic schedule for satisfiability detection.
% 0.08/0.44 % (3872632)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=602163812:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.44 % (3872632) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3872623-3872632"...
% 0.08/0.44 % (3872632)...printing done.
% 0.08/0.44 % (3872632)Refutation found. Thanks to Tanya!
% 0.08/0.44 % SZS status Theorem for theBenchmark
% 0.08/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.44 % (3872632)------------------------------
% 0.08/0.44 % (3872632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.44 % (3872632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.44 % (3872632)CaDiCaL version: 2.1.3
% 0.08/0.44 % (3872632)Termination reason: Refutation
% 0.08/0.44 % (3872632)Time elapsed: 0.001 s
% 0.08/0.44 % (3872632)Peak memory usage: 11 MB
% 0.08/0.44 % (3872623)Success in time 0.028 s
% 0.08/0.44 % Vampire exiting
%------------------------------------------------------------------------------