%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN076+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 : n007.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:04 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 115 ( 41 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 125 ( 48 ~; 35 |; 42 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 1 con; 0-2 aty)
% Number of variables : 112 ( 82 !; 30 ?)
% 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(f5,axiom,
! [X0,X1] :
? [X2] :
( ? [X3] :
( ? [X4] :
( r2(X1,X4)
& r3(X0,X4,X3) )
& X3 = X2 )
& ? [X5] :
( r2(X5,X2)
& r3(X0,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(f6,axiom,
! [X0,X1] :
? [X2] :
( ? [X3] :
( ? [X4] :
( r2(X1,X4)
& r4(X0,X4,X3) )
& X3 = X2 )
& ? [X5] :
( r3(X5,X0,X2)
& r4(X0,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).
fof(f8,axiom,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& r3(X0,X2,X1) )
& X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
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,X2] :
( ? [X3] :
( X3 = X0
& ? [X4] :
( r4(X4,X1,X3)
& ? [X5] :
( r2(X5,X4)
& ? [X6] :
( r1(X6)
& r2(X6,X5) ) ) ) )
& ? [X7] :
( r3(X1,X2,X7)
& X7 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thereexistsanevennumber) ).
fof(f13,negated_conjecture,
~ ? [X0,X1,X2] :
( ? [X3] :
( X3 = X0
& ? [X4] :
( r4(X4,X1,X3)
& ? [X5] :
( r2(X5,X4)
& ? [X6] :
( r1(X6)
& r2(X6,X5) ) ) ) )
& ? [X7] :
( r3(X1,X2,X7)
& X7 = X0 ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ! [X3] :
( X0 != X3
| ! [X4] :
( ~ r4(X4,X1,X3)
| ! [X5] :
( ~ r2(X5,X4)
| ! [X6] :
( ~ r1(X6)
| ~ r2(X6,X5) ) ) ) )
| ! [X7] :
( ~ r3(X1,X2,X7)
| X0 != X7 ) ),
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(f19,plain,
! [X0,X1] :
( r2(X1,sK6(X0,X1))
& r3(X0,sK6(X0,X1),sK5(X0,X1))
& sK4(X0,X1) = sK5(X0,X1)
& r2(sK7(X0,X1),sK4(X0,X1))
& r3(X0,X1,sK7(X0,X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1)),skolemize(X5,sK7(X0,X1))],[f5]) ).
fof(f20,plain,
! [X0,X1] :
( r2(X1,sK10(X0,X1))
& r4(X0,sK10(X0,X1),sK9(X0,X1))
& sK8(X0,X1) = sK9(X0,X1)
& r3(sK11(X0,X1),X0,sK8(X0,X1))
& r4(X0,X1,sK11(X0,X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11]),skolemize(X2,sK8(X0,X1)),skolemize(X3,sK9(X0,X1)),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f6]) ).
fof(f21,plain,
! [X0] :
( r1(sK13(X0))
& r3(X0,sK13(X0),sK12(X0))
& sK12(X0) = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f8]) ).
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(f44,plain,
! [X0,X1] : r2(X1,sK6(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X0,X1] : r2(X1,sK10(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f51,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f21]) ).
fof(f52,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f21]) ).
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,X3,X0,X1,X6,X7,X4,X5] :
( ~ r1(X6)
| ~ r4(X4,X1,X3)
| ~ r2(X5,X4)
| X0 != X3
| ~ r2(X6,X5)
| ~ r3(X1,X2,X7)
| X0 != X7 ),
inference(cnf_transformation,[],[f14]) ).
fof(f66,plain,
! [X0] : r4(X0,sK15(X0),sK16(X0)),
inference(definition_unfolding,[],[f56,f54]) ).
fof(f67,plain,
! [X0] : r3(X0,sK13(X0),X0),
inference(forward_demodulation,[],[f52,f51]) ).
fof(f71,plain,
r1(sK0),
inference(equality_resolution,[],[f25]) ).
fof(f73,plain,
! [X0] : sK0 = sK16(X0),
inference(resolution,[],[f26,f55]) ).
fof(f74,plain,
! [X0] : sK0 = sK15(X0),
inference(resolution,[],[f26,f57]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r2(X3,X0)
| ~ r4(X0,X1,X2)
| X2 != X4
| ~ r2(sK0,X3)
| ~ r3(X1,X5,X6)
| X4 != X6 ),
inference(resolution,[],[f71,f63]) ).
fof(f80,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r2(sK0,X1)
| X3 != X4
| ~ r4(sK6(X0,X1),X2,X3)
| ~ r3(X2,X5,X6)
| X4 != X6 ),
inference(resolution,[],[f76,f44]) ).
fof(f86,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r4(sK6(X2,sK10(X3,sK0)),X4,X0)
| X0 != X1
| ~ r3(X4,X5,X6)
| X1 != X6 ),
inference(resolution,[],[f80,f49]) ).
fof(f92,plain,
! [X2,X3,X0,X1,X4] :
( sK16(sK6(X0,sK10(X1,sK0))) != X2
| ~ r3(sK15(sK6(X0,sK10(X1,sK0))),X3,X4)
| X2 != X4 ),
inference(resolution,[],[f66,f86]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X4] :
( sK0 != X2
| ~ r3(sK15(sK6(X0,sK10(X1,sK0))),X3,X4)
| X2 != X4 ),
inference(forward_demodulation,[],[f92,f73]) ).
fof(f95,plain,
! [X2,X3,X4] :
( ~ r3(sK0,X3,X4)
| sK0 != X2
| X2 != X4 ),
inference(forward_demodulation,[],[f93,f74]) ).
fof(f97,plain,
! [X0] :
( sK0 != X0
| sK0 != X0 ),
inference(resolution,[],[f95,f67]) ).
fof(f99,plain,
! [X0] : sK0 != X0,
inference(duplicate_literal_removal,[],[f97]) ).
fof(f101,plain,
$false,
inference(equality_resolution,[],[f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN076+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.39 % Computer : n007.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 21:55:11 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.47 % (1813803)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1813813)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3113337184:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (1813813) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1813803-1813813"...
% 0.17/0.47 % (1813809)% WARNING: option uhcvi not known.
% 0.17/0.47 % (1813813)...printing done.
% 0.17/0.47 % (1813813)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (1813813)------------------------------
% 0.17/0.47 % (1813813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1813813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1813813)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1813813)Termination reason: Refutation
% 0.17/0.47 % (1813813)Time elapsed: 0.002 s
% 0.17/0.47 % (1813813)Peak memory usage: 11 MB
% 0.17/0.47 % (1813813)Instructions burned: 5 (million)
% 0.17/0.47 % (1813803)Success in time 0.033 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------