%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS181+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 11:42:28 AM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 34 ~; 32 |; 15 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 62 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(f3,axiom,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) )
<=> nota(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(f14,conjecture,
! [X0,X1,X2] :
( ( isa(X0,X1)
& nota(X0,X2) )
=> nota(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nota_isa_nota) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( ( isa(X0,X1)
& nota(X0,X2) )
=> nota(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| ~ isa(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ~ nota(X1,X2)
& isa(X0,X1)
& nota(X0,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ nota(X1,X2)
& isa(X0,X1)
& nota(X0,X2) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( ? [X2,X3] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X0)
| status(X2,X3,X1) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0,X1] :
( ( ? [X2,X3] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X4,X5] :
( ~ status(X4,X5,X0)
| status(X4,X5,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( ( status(sK0(X0,X1),sK1(X0,X1),X0)
& ~ status(sK0(X0,X1),sK1(X0,X1),X1) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X4,X5] :
( ~ status(X4,X5,X0)
| status(X4,X5,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0,X1))],[f22]) ).
fof(f32,plain,
( ~ nota(sK21,sK22)
& isa(sK20,sK21)
& nota(sK20,sK22) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22)],[f20]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X0)
| status(X2,X3,X1)
| ~ isa(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X0,X1,X4,X5] :
( ~ status(X4,X5,X0)
| nota(X0,X1)
| status(X4,X5,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
! [X0,X1] :
( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
| ~ nota(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( status(sK0(X0,X1),sK1(X0,X1),X0)
| ~ nota(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f56,plain,
nota(sK20,sK22),
inference(cnf_transformation,[],[f32]) ).
fof(f57,plain,
isa(sK20,sK21),
inference(cnf_transformation,[],[f32]) ).
fof(f58,plain,
~ nota(sK21,sK22),
inference(cnf_transformation,[],[f32]) ).
fof(f71,plain,
! [X2,X0,X1] :
( status(sK0(X0,X1),sK1(X0,X1),X2)
| nota(X0,X2)
| ~ nota(X0,X1) ),
inference(resolution,[],[f36,f34]) ).
fof(f72,plain,
! [X2,X0,X1] :
( status(sK0(X0,X1),sK1(X0,X1),X2)
| ~ nota(X0,X1)
| ~ isa(X0,X2) ),
inference(resolution,[],[f36,f33]) ).
fof(f75,plain,
! [X2,X3,X0,X1] :
( ~ nota(X0,X2)
| nota(X0,X1)
| nota(X1,X3)
| status(sK0(X0,X2),sK1(X0,X2),X3) ),
inference(resolution,[],[f71,f34]) ).
fof(f78,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ~ isa(X0,X1)
| ~ nota(X0,X1) ),
inference(resolution,[],[f72,f35]) ).
fof(f81,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ~ isa(X0,X1) ),
inference(duplicate_literal_removal,[],[f78]) ).
fof(f83,plain,
! [X0,X1] :
( nota(sK20,X0)
| nota(X0,X1)
| status(sK0(sK20,sK22),sK1(sK20,sK22),X1) ),
inference(resolution,[],[f75,f56]) ).
fof(f92,plain,
! [X0] :
( nota(sK20,X0)
| nota(X0,sK22)
| ~ nota(sK20,sK22) ),
inference(resolution,[],[f83,f35]) ).
fof(f95,plain,
! [X0] :
( nota(sK20,X0)
| nota(X0,sK22) ),
inference(forward_subsumption_resolution,[],[f92,f56]) ).
fof(f103,plain,
nota(sK20,sK21),
inference(resolution,[],[f95,f58]) ).
fof(f118,plain,
~ isa(sK20,sK21),
inference(resolution,[],[f103,f81]) ).
fof(f119,plain,
$false,
inference(forward_subsumption_resolution,[],[f118,f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS181+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 13:40:17 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.43 % (2657813)Will run a generic schedule for satisfiability detection.
% 0.10/0.43 % (2657821)dis+10_1_sil=32000:sp=arity:random_seed=3906749006:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.43 % (2657821) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2657813-2657821"...
% 0.10/0.43 % (2657821)...printing done.
% 0.10/0.43 % (2657821)Refutation found. Thanks to Tanya!
% 0.10/0.43 % SZS status Theorem for theBenchmark
% 0.10/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.43 % (2657821)------------------------------
% 0.10/0.43 % (2657821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43 % (2657821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43 % (2657821)CaDiCaL version: 2.1.3
% 0.10/0.43 % (2657821)Termination reason: Refutation
% 0.10/0.43 % (2657821)Time elapsed: 0.002 s
% 0.10/0.43 % (2657821)Peak memory usage: 11 MB
% 0.10/0.43 % (2657821)Instructions burned: 3 (million)
% 0.10/0.43 % (2657813)Success in time 0.025 s
% 0.10/0.43 % Vampire exiting
%------------------------------------------------------------------------------