%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN069+1 : 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:02 PM UTC 2026
% Result : Theorem 0.05s 0.44s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 1 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 7 |; 16 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 30 ( 0 sgn 20 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : id(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
fof(f12,axiom,
! [X0,X1] :
? [X2] :
( ? [X3] :
( id(X3,X2)
& ? [X4] :
( r2(X1,X4)
& r3(X0,X4,X3) ) )
& ? [X5] :
( r2(X5,X2)
& r3(X0,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
fof(f15,axiom,
! [X0] :
? [X1] :
( id(X1,X0)
& ? [X2] :
( r1(X2)
& r3(X0,X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
fof(f19,conjecture,
? [X0] :
( id(X0,X0)
& ? [X1] :
( r1(X1)
& r2(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneidone) ).
fof(f20,negated_conjecture,
~ ? [X0] :
( id(X0,X0)
& ? [X1] :
( r1(X1)
& r2(X1,X0) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0] :
( ~ id(X0,X0)
| ! [X1] :
( ~ r1(X1)
| ~ r2(X1,X0) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f26,plain,
! [X0,X1] :
( id(sK5(X0,X1),sK4(X0,X1))
& r2(X1,sK6(X0,X1))
& r3(X0,sK6(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))],[f12]) ).
fof(f28,plain,
! [X0] :
( id(sK12(X0),X0)
& r1(sK13(X0))
& r3(X0,sK13(X0),sK12(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f15]) ).
fof(f47,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f69,plain,
! [X0,X1] : r2(X1,sK6(X0,X1)),
inference(cnf_transformation,[],[f26]) ).
fof(f78,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f89,plain,
! [X0,X1] :
( ~ r2(X1,X0)
| ~ r1(X1)
| ~ id(X0,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f94,definition,
( spl20_2
<=> ! [X1] : ~ r1(X1) ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
fof(f95,plain,
( ! [X1] : ~ r1(X1)
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f101,plain,
( $false
| ~ spl20_2 ),
inference(forward_subsumption_resolution,[],[f78,f95]) ).
fof(f102,plain,
~ spl20_2,
inference(avatar_contradiction_clause,[],[f101]) ).
fof(f130,plain,
! [X0,X1] :
( ~ r1(X0)
| ~ id(sK6(X1,X0),sK6(X1,X0)) ),
inference(resolution,[],[f69,f89]) ).
fof(f134,plain,
! [X0] : ~ r1(X0),
inference(forward_subsumption_resolution,[],[f130,f47]) ).
fof(f135,plain,
spl20_2,
inference(avatar_split_clause,[],[f134,f94]) ).
cnf(s52,plain,
~ spl20_2,
inference(sat_conversion,[],[f102]) ).
cnf(s87,plain,
spl20_2,
inference(sat_conversion,[],[f135]) ).
cnf(s88,plain,
$false,
inference(rat,[],[s52,s87]) ).
fof(f136,plain,
$false,
inference(avatar_sat_refutation,[],[s88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN069+1 : 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.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.05/0.36 % CPULimit : 300
% 0.05/0.36 % WCLimit : 300
% 0.05/0.36 % DateTime : Sun Sep 27 21:56:31 UTC 2026
% 0.05/0.36 % CPUTime :
% 0.05/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.39 Running first-order model finding
% 0.05/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.05/0.44 % (2048704)Will run a generic schedule for satisfiability detection.
% 0.05/0.44 % (2048711)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1050393834:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.05/0.44 % (2048711) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2048704-2048711"...
% 0.05/0.44 % (2048711)...printing done.
% 0.05/0.44 % (2048710)% WARNING: option uhcvi not known.
% 0.05/0.44 % (2048711)Refutation found. Thanks to Tanya!
% 0.05/0.44 % SZS status Theorem for theBenchmark
% 0.05/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/0.44 % (2048711)------------------------------
% 0.05/0.44 % (2048711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/0.44 % (2048711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/0.44 % (2048711)CaDiCaL version: 2.1.3
% 0.05/0.44 % (2048711)Termination reason: Refutation
% 0.05/0.44 % (2048711)Time elapsed: 0.002 s
% 0.05/0.44 % (2048711)Peak memory usage: 12 MB
% 0.05/0.44 % (2048711)Instructions burned: 2 (million)
% 0.05/0.44 % (2048704)Success in time 0.034 s
% 0.05/0.44 % Vampire exiting
%------------------------------------------------------------------------------