%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS180+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 : n009.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.13s 0.46s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 11 unt; 3 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 120 ( 50 ~; 41 |; 9 &)
% ( 7 <=>; 10 =>; 0 <=; 3 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 78 !; 14 ?)
% 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(f4,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(f5,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) )
<=> xora(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',xora) ).
fof(f14,conjecture,
! [X0,X1] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( isa(X0,X1)
& ( nota(X0,X1)
| nevera(X0,X1)
| xora(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_exclusive) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( isa(X0,X1)
& ( nota(X0,X1)
| nevera(X0,X1)
| xora(X0,X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( xora(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f17,plain,
! [X0,X1] :
( nevera(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f18,plain,
! [X0,X1] :
( nota(X0,X1)
=> ? [X2,X3] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f20,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| ~ isa(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) )
| ~ nota(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
! [X0,X1] :
( ! [X2,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| ~ nevera(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f23,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) )
| ~ xora(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
? [X0,X1] :
! [X2,X3] :
( isa(X0,X1)
& ( nota(X0,X1)
| nevera(X0,X1)
| xora(X0,X1) )
& status(X2,X3,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f26,plain,
? [X0,X1] :
! [X2,X3] :
( isa(X0,X1)
& ( nota(X0,X1)
| nevera(X0,X1)
| xora(X0,X1) )
& status(X2,X3,X0) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( ~ isa(X0,X1)
| ~ status(X2,X3,X0)
| status(X2,X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f28,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( ~ nevera(X0,X1)
| ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( ~ xora(X0,X1)
| ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f52,plain,
( xora(sK20,sK21)
| nevera(sK20,sK21)
| nota(sK20,sK21) ),
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
! [X2,X3] : status(X2,X3,sK20),
inference(cnf_transformation,[],[f26]) ).
fof(f54,plain,
isa(sK20,sK21),
inference(cnf_transformation,[],[f26]) ).
fof(f56,definition,
( spl22_1
<=> nota(sK20,sK21) ),
introduced(definition,[new_symbols(definition,[spl22_1])],[avatar_definition]) ).
fof(f58,plain,
( nota(sK20,sK21)
| ~ spl22_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f60,definition,
( spl22_2
<=> nevera(sK20,sK21) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f62,plain,
( nevera(sK20,sK21)
| ~ spl22_2 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl22_3
<=> xora(sK20,sK21) ),
introduced(definition,[new_symbols(definition,[spl22_3])],[avatar_definition]) ).
fof(f66,plain,
( xora(sK20,sK21)
| ~ spl22_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( spl22_1
| spl22_2
| spl22_3 ),
inference(avatar_split_clause,[],[f52,f64,f60,f56]) ).
fof(f79,plain,
! [X0,X1] :
( ~ status(X0,X1,sK20)
| status(X0,X1,sK21) ),
inference(resolution,[],[f27,f54]) ).
fof(f80,plain,
! [X0,X1] : status(X0,X1,sK21),
inference(forward_subsumption_resolution,[],[f79,f53]) ).
fof(f81,plain,
( ! [X0,X1] :
( ~ status(X0,X1,sK20)
| ~ status(X0,X1,sK21) )
| ~ spl22_2 ),
inference(resolution,[],[f30,f62]) ).
fof(f82,plain,
( ! [X0,X1] : ~ status(X0,X1,sK21)
| ~ spl22_2 ),
inference(forward_subsumption_resolution,[],[f81,f53]) ).
fof(f83,plain,
( $false
| ~ spl22_2 ),
inference(forward_subsumption_resolution,[],[f82,f80]) ).
fof(f84,plain,
~ spl22_2,
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f86,plain,
( ! [X0,X1] :
( ~ status(X0,X1,sK21)
| ~ status(X0,X1,sK20) )
| ~ spl22_3 ),
inference(resolution,[],[f32,f66]) ).
fof(f87,plain,
( ! [X0,X1] : ~ status(X0,X1,sK20)
| ~ spl22_3 ),
inference(forward_subsumption_resolution,[],[f86,f80]) ).
fof(f88,plain,
( $false
| ~ spl22_3 ),
inference(forward_subsumption_resolution,[],[f87,f53]) ).
fof(f89,plain,
~ spl22_3,
inference(avatar_contradiction_clause,[],[f88]) ).
fof(f91,plain,
( ~ status(sK0(sK20,sK21),sK1(sK20,sK21),sK21)
| ~ spl22_1 ),
inference(resolution,[],[f58,f28]) ).
fof(f92,plain,
( $false
| ~ spl22_1 ),
inference(forward_subsumption_resolution,[],[f91,f80]) ).
fof(f93,plain,
~ spl22_1,
inference(avatar_contradiction_clause,[],[f92]) ).
cnf(s1,plain,
( spl22_1
| spl22_2
| spl22_3 ),
inference(sat_conversion,[],[f67]) ).
cnf(s3,plain,
~ spl22_2,
inference(sat_conversion,[],[f84]) ).
cnf(s4,plain,
~ spl22_3,
inference(sat_conversion,[],[f89]) ).
cnf(s5,plain,
~ spl22_1,
inference(sat_conversion,[],[f93]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s4,s3,s5]) ).
fof(f94,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS180+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n009.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 13:34:30 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.13/0.46 % (2042466)Will run a generic schedule for satisfiability detection.
% 0.13/0.46 % (2042475)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3121291879:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.46 % (2042475) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2042466-2042475"...
% 0.13/0.46 % (2042475)...printing done.
% 0.13/0.46 % (2042475)Refutation found. Thanks to Tanya!
% 0.13/0.46 % SZS status Theorem for theBenchmark
% 0.13/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.46 % (2042475)------------------------------
% 0.13/0.46 % (2042475)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.46 % (2042475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.46 % (2042475)CaDiCaL version: 2.1.3
% 0.13/0.46 % (2042475)Termination reason: Refutation
% 0.13/0.46 % (2042475)Time elapsed: 0.002 s
% 0.13/0.46 % (2042475)Peak memory usage: 12 MB
% 0.13/0.46 % (2042475)Instructions burned: 3 (million)
% 0.13/0.46 % (2042466)Success in time 0.03 s
% 0.13/0.46 % Vampire exiting
%------------------------------------------------------------------------------