%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN087+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 : n015.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:06 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 53 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 21 ~; 13 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 33 ( 23 !; 10 ?)
% 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(f9,axiom,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& r4(X0,X2,X1) )
& ? [X3] :
( r1(X3)
& X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(f12,conjecture,
? [X0] :
( ? [X1] :
( r1(X1)
& r4(X1,X1,X0) )
& ? [X2] :
( r1(X2)
& X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).
fof(f13,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( r1(X1)
& r4(X1,X1,X0) )
& ? [X2] :
( r1(X2)
& X0 = X2 ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0] :
( ! [X1] :
( ~ r1(X1)
| ~ r4(X1,X1,X0) )
| ! [X2] :
( ~ r1(X2)
| X0 != X2 ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
! [X1] :
( ( ~ r1(X1)
& sK0 != X1 )
| ( r1(X1)
& sK0 = X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).
fof(f22,plain,
! [X0] :
( r1(sK15(X0))
& r4(X0,sK15(X0),sK14(X0))
& r1(sK16(X0))
& sK14(X0) = sK16(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f9]) ).
fof(f25,plain,
! [X1] :
( sK0 != X1
| r1(X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X1] :
( ~ r1(X1)
| sK0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f54,plain,
! [X0] : sK14(X0) = sK16(X0),
inference(cnf_transformation,[],[f22]) ).
fof(f55,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f56,plain,
! [X0] : r4(X0,sK15(X0),sK14(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f57,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ r1(X1)
| ~ r4(X1,X1,X0)
| ~ r1(X2)
| X0 != X2 ),
inference(cnf_transformation,[],[f14]) ).
fof(f66,plain,
! [X0] : r4(X0,sK15(X0),sK16(X0)),
inference(definition_unfolding,[],[f56,f54]) ).
fof(f67,plain,
r1(sK0),
inference(equality_resolution,[],[f25]) ).
fof(f77,plain,
! [X2,X1] :
( ~ r4(X1,X1,X2)
| ~ r1(X1)
| ~ r1(X2) ),
inference(equality_resolution,[],[f63]) ).
fof(f97,plain,
! [X0] : sK0 = sK15(X0),
inference(resolution,[],[f26,f57]) ).
fof(f98,plain,
! [X0] : sK0 = sK16(X0),
inference(resolution,[],[f26,f55]) ).
fof(f122,plain,
! [X0] : r4(X0,sK15(X0),sK0),
inference(forward_demodulation,[],[f66,f98]) ).
fof(f123,plain,
! [X0] : r4(X0,sK0,sK0),
inference(forward_demodulation,[],[f122,f97]) ).
fof(f124,plain,
( ~ r1(sK0)
| ~ r1(sK0) ),
inference(resolution,[],[f123,f77]) ).
fof(f125,plain,
~ r1(sK0),
inference(duplicate_literal_removal,[],[f124]) ).
fof(f126,plain,
$false,
inference(forward_subsumption_resolution,[],[f125,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN087+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 : n015.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 22:03:31 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.39 Running first-order model finding
% 0.11/0.39 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.44 % (2051672)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (2051679)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2325993819:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.44 % (2051679) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2051672-2051679"...
% 0.11/0.44 % (2051679)...printing done.
% 0.11/0.44 % (2051679)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (2051679)------------------------------
% 0.11/0.44 % (2051679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (2051679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (2051679)CaDiCaL version: 2.1.3
% 0.11/0.44 % (2051679)Termination reason: Refutation
% 0.11/0.44 % (2051679)Time elapsed: 0.002 s
% 0.11/0.44 % (2051679)Peak memory usage: 12 MB
% 0.11/0.44 % (2051679)Instructions burned: 3 (million)
% 0.11/0.44 % (2051672)Success in time 0.033 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------