%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:27:07 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 40 ( 11 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 24 ~; 16 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 20 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ r1(X1)
& X1 != X0 )
| ( r1(X1)
& X1 = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(f11,axiom,
! [X0,X1] :
( ! [X2] :
( ~ r1(X2)
| X2 != X1 )
| ~ r2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(f12,conjecture,
! [X0] :
( ! [X1] :
( ! [X2] :
( ~ r1(X2)
| ~ r2(X2,X1) )
| ~ r2(X1,X0) )
| ! [X3] :
( X3 != X0
| ~ r1(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqtwo) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( ! [X2] :
( ~ r1(X2)
| ~ r2(X2,X1) )
| ~ r2(X1,X0) )
| ! [X3] :
( X3 != X0
| ~ r1(X3) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( r1(X2)
& r2(X2,X1) )
& r2(X1,X0) )
& ? [X3] :
( X0 = X3
& r1(X3) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f1]) ).
fof(f16,plain,
! [X1] :
( ~ r1(X1)
| sK0 = X1 ),
inference(cnf_transformation,[],[f1]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f48,plain,
r2(sK22,sK20),
inference(cnf_transformation,[],[f14]) ).
fof(f49,plain,
r1(sK21),
inference(cnf_transformation,[],[f14]) ).
fof(f50,plain,
sK20 = sK21,
inference(cnf_transformation,[],[f14]) ).
fof(f54,plain,
r2(sK22,sK21),
inference(definition_unfolding,[],[f48,f50]) ).
fof(f55,plain,
r1(sK0),
inference(equality_resolution,[],[f15]) ).
fof(f60,plain,
! [X2,X0] :
( ~ r1(X2)
| ~ r2(X0,X2) ),
inference(equality_resolution,[],[f45]) ).
fof(f65,plain,
sK0 = sK21,
inference(resolution,[],[f16,f49]) ).
fof(f67,plain,
r2(sK22,sK0),
inference(superposition,[],[f54,f65]) ).
fof(f71,plain,
! [X0] : ~ r2(X0,sK0),
inference(resolution,[],[f60,f55]) ).
fof(f82,plain,
$false,
inference(resolution,[],[f71,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN089+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 21:59:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/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.11/0.45 % (1351868)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1351877)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1925037595:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (1351877) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1351868-1351877"...
% 0.11/0.45 % (1351877)...printing done.
% 0.11/0.45 % (1351877)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1351877)------------------------------
% 0.11/0.45 % (1351877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1351877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1351877)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1351877)Termination reason: Refutation
% 0.11/0.45 % (1351877)Time elapsed: 0.002 s
% 0.11/0.45 % (1351877)Peak memory usage: 12 MB
% 0.11/0.45 % (1351877)Instructions burned: 2 (million)
% 0.11/0.45 % (1351868)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------