%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE029+1 : TPTP v9.3.1. Released v4.0.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:40:42 AM UTC 2026
% Result : Theorem 0.68s 0.62s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 135 ( 17 unt; 8 def)
% Number of atoms : 358 ( 31 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 390 ( 167 ~; 197 |; 8 &)
% ( 16 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 98 ( 0 sgn 95 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f13,axiom,
! [X0,X1,X2] :
( ismeet(X2,X0,X1)
<=> ( leq(X2,X0)
& leq(X2,X1)
& ! [X3] :
( ( leq(X3,X0)
& leq(X3,X1) )
=> leq(X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+3.ax',ismeet) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ismeetu(X2,X0,X1)
<=> ! [X3] :
( ( leq(X3,X0)
& leq(X3,X1) )
<=> leq(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+3.ax',ismeetu) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ismeet(X0,X1,X2)
<=> ismeetu(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ismeet(X0,X1,X2)
<=> ismeetu(X0,X1,X2) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ismeet(X2,X0,X1)
<=> ( leq(X2,X0)
& leq(X2,X1)
& ! [X3] :
( leq(X3,X2)
| ~ leq(X3,X0)
| ~ leq(X3,X1) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ismeet(X2,X0,X1)
<=> ( leq(X2,X0)
& leq(X2,X1)
& ! [X3] :
( leq(X3,X2)
| ~ leq(X3,X0)
| ~ leq(X3,X1) ) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ismeet(X0,X1,X2)
<~> ismeetu(X0,X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f20,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f23,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f32,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ismeet(X2,X0,X1)
| ~ leq(X2,X1)
| ~ leq(X2,X0)
| leq(sK0(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ismeet(X2,X0,X1)
| ~ leq(X2,X1)
| ~ leq(X2,X0)
| leq(sK0(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ismeet(X2,X0,X1)
| ~ leq(X2,X1)
| ~ leq(X2,X0)
| ~ leq(sK0(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ ismeet(X2,X0,X1)
| ~ leq(X3,X0)
| leq(X3,X2)
| ~ leq(X3,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ ismeet(X2,X0,X1)
| leq(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ ismeet(X2,X0,X1)
| leq(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ismeetu(X2,X0,X1)
| ~ leq(sK1(X0,X1,X2),X1)
| ~ leq(sK1(X0,X1,X2),X0)
| ~ leq(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ismeetu(X2,X0,X1)
| leq(sK1(X0,X1,X2),X1)
| leq(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ismeetu(X2,X0,X1)
| leq(sK1(X0,X1,X2),X0)
| leq(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( ~ ismeetu(X2,X0,X1)
| ~ leq(X3,X1)
| ~ leq(X3,X0)
| leq(X3,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ ismeetu(X2,X0,X1)
| leq(X3,X1)
| ~ leq(X3,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f44,plain,
! [X2,X3,X0,X1] :
( ~ ismeetu(X2,X0,X1)
| leq(X3,X0)
| ~ leq(X3,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f45,plain,
( ismeetu(sK2,sK3,sK4)
| ismeet(sK2,sK3,sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f46,plain,
( ~ ismeetu(sK2,sK3,sK4)
| ~ ismeet(sK2,sK3,sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f48,definition,
( spl5_1
<=> ismeet(sK2,sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f49,plain,
( ~ ismeet(sK2,sK3,sK4)
| spl5_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f50,plain,
( ismeet(sK2,sK3,sK4)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f52,definition,
( spl5_2
<=> ismeetu(sK2,sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f53,plain,
( ~ ismeetu(sK2,sK3,sK4)
| spl5_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f54,plain,
( ismeetu(sK2,sK3,sK4)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f45,f52,f48]) ).
fof(f56,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f46,f52,f48]) ).
fof(f66,plain,
( ! [X0] :
( leq(X0,sK4)
| ~ leq(X0,sK2) )
| ~ spl5_2 ),
inference(resolution,[],[f43,f54]) ).
fof(f67,plain,
( ! [X0] :
( leq(X0,sK3)
| ~ leq(X0,sK2) )
| ~ spl5_2 ),
inference(resolution,[],[f44,f54]) ).
fof(f72,plain,
! [X2,X0,X1] : addition(addition(X0,X1),X2) = addition(X1,addition(X0,X2)),
inference(superposition,[],[f21,f20]) ).
fof(f82,plain,
! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
inference(superposition,[],[f20,f21]) ).
fof(f186,plain,
( ~ leq(sK2,sK4)
| ~ leq(sK2,sK3)
| leq(sK0(sK3,sK4,sK2),sK4)
| spl5_1 ),
inference(resolution,[],[f33,f49]) ).
fof(f191,definition,
( spl5_3
<=> leq(sK0(sK3,sK4,sK2),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f193,plain,
( leq(sK0(sK3,sK4,sK2),sK4)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f195,definition,
( spl5_4
<=> leq(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f196,plain,
( leq(sK2,sK3)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f197,plain,
( ~ leq(sK2,sK3)
| spl5_4 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f199,definition,
( spl5_5
<=> leq(sK2,sK4) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f200,plain,
( leq(sK2,sK4)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f201,plain,
( ~ leq(sK2,sK4)
| spl5_5 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f202,plain,
( spl5_3
| ~ spl5_4
| ~ spl5_5
| spl5_1 ),
inference(avatar_split_clause,[],[f186,f48,f199,f195,f191]) ).
fof(f203,plain,
( ~ leq(sK2,sK2)
| ~ spl5_2
| spl5_4 ),
inference(resolution,[],[f197,f67]) ).
fof(f209,plain,
( sK2 != addition(sK2,sK2)
| ~ spl5_2
| spl5_4 ),
inference(resolution,[],[f203,f31]) ).
fof(f210,plain,
( $false
| ~ spl5_2
| spl5_4 ),
inference(forward_subsumption_resolution,[],[f209,f23]) ).
fof(f211,plain,
( ~ spl5_2
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f210]) ).
fof(f216,plain,
( sK3 = addition(sK2,sK3)
| ~ spl5_4 ),
inference(resolution,[],[f196,f32]) ).
fof(f220,plain,
( ~ leq(sK2,sK2)
| ~ spl5_2
| spl5_5 ),
inference(resolution,[],[f201,f66]) ).
fof(f225,plain,
( sK2 != addition(sK2,sK2)
| ~ spl5_2
| spl5_5 ),
inference(resolution,[],[f220,f31]) ).
fof(f226,plain,
( $false
| ~ spl5_2
| spl5_5 ),
inference(forward_subsumption_resolution,[],[f225,f23]) ).
fof(f227,plain,
( ~ spl5_2
| spl5_5 ),
inference(avatar_contradiction_clause,[],[f226]) ).
fof(f230,plain,
( leq(sK2,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f50,f37]) ).
fof(f231,plain,
( $false
| ~ spl5_1
| spl5_5 ),
inference(forward_subsumption_resolution,[],[f230,f201]) ).
fof(f232,plain,
( ~ spl5_1
| spl5_5 ),
inference(avatar_contradiction_clause,[],[f231]) ).
fof(f233,plain,
( sK4 = addition(sK2,sK4)
| ~ spl5_5 ),
inference(resolution,[],[f200,f32]) ).
fof(f234,plain,
( ~ leq(sK2,sK4)
| ~ leq(sK2,sK3)
| ~ leq(sK0(sK3,sK4,sK2),sK2)
| spl5_1 ),
inference(resolution,[],[f49,f35]) ).
fof(f235,plain,
( ~ leq(sK2,sK4)
| ~ leq(sK2,sK3)
| leq(sK0(sK3,sK4,sK2),sK3)
| spl5_1 ),
inference(resolution,[],[f49,f34]) ).
fof(f237,plain,
( ~ leq(sK2,sK3)
| leq(sK0(sK3,sK4,sK2),sK3)
| spl5_1
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f235,f200]) ).
fof(f238,plain,
( ~ leq(sK2,sK3)
| ~ leq(sK0(sK3,sK4,sK2),sK2)
| spl5_1
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f234,f200]) ).
fof(f239,plain,
( leq(sK0(sK3,sK4,sK2),sK3)
| spl5_1
| ~ spl5_4
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f237,f196]) ).
fof(f240,plain,
( ~ leq(sK0(sK3,sK4,sK2),sK2)
| spl5_1
| ~ spl5_4
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f238,f196]) ).
fof(f241,plain,
( ! [X0] :
( ~ leq(X0,sK4)
| ~ leq(X0,sK3)
| leq(X0,sK2) )
| ~ spl5_2 ),
inference(resolution,[],[f54,f42]) ).
fof(f247,plain,
( ! [X0] : addition(sK3,X0) = addition(sK2,addition(sK3,X0))
| ~ spl5_4 ),
inference(superposition,[],[f21,f216]) ).
fof(f260,plain,
( ~ leq(sK0(sK3,sK4,sK2),sK3)
| leq(sK0(sK3,sK4,sK2),sK2)
| ~ spl5_2
| ~ spl5_3 ),
inference(resolution,[],[f241,f193]) ).
fof(f261,plain,
( leq(sK0(sK3,sK4,sK2),sK2)
| spl5_1
| ~ spl5_2
| ~ spl5_3
| ~ spl5_4
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f260,f239]) ).
fof(f263,plain,
( $false
| spl5_1
| ~ spl5_2
| ~ spl5_3
| ~ spl5_4
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f261,f240]) ).
fof(f264,plain,
( spl5_1
| ~ spl5_2
| ~ spl5_3
| ~ spl5_4
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f263]) ).
fof(f265,plain,
( ! [X0] :
( ~ leq(X0,sK4)
| leq(X0,sK2)
| ~ leq(X0,sK3) )
| ~ spl5_1 ),
inference(resolution,[],[f50,f36]) ).
fof(f266,plain,
( leq(sK2,sK3)
| ~ spl5_1 ),
inference(resolution,[],[f50,f38]) ).
fof(f268,plain,
( ~ leq(sK1(sK3,sK4,sK2),sK4)
| ~ leq(sK1(sK3,sK4,sK2),sK3)
| ~ leq(sK1(sK3,sK4,sK2),sK2)
| spl5_2 ),
inference(resolution,[],[f53,f39]) ).
fof(f269,plain,
( leq(sK1(sK3,sK4,sK2),sK3)
| leq(sK1(sK3,sK4,sK2),sK2)
| spl5_2 ),
inference(resolution,[],[f53,f41]) ).
fof(f270,plain,
( leq(sK1(sK3,sK4,sK2),sK4)
| leq(sK1(sK3,sK4,sK2),sK2)
| spl5_2 ),
inference(resolution,[],[f53,f40]) ).
fof(f272,definition,
( spl5_6
<=> leq(sK1(sK3,sK4,sK2),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).
fof(f274,plain,
( leq(sK1(sK3,sK4,sK2),sK2)
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f276,definition,
( spl5_7
<=> leq(sK1(sK3,sK4,sK2),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_7])],[avatar_definition]) ).
fof(f277,plain,
( ~ leq(sK1(sK3,sK4,sK2),sK4)
| spl5_7 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f279,plain,
( spl5_6
| spl5_7
| spl5_2 ),
inference(avatar_split_clause,[],[f270,f52,f276,f272]) ).
fof(f281,definition,
( spl5_8
<=> leq(sK1(sK3,sK4,sK2),sK3) ),
introduced(definition,[new_symbols(definition,[spl5_8])],[avatar_definition]) ).
fof(f282,plain,
( ~ leq(sK1(sK3,sK4,sK2),sK3)
| spl5_8 ),
inference(avatar_component_clause,[],[f281]) ).
fof(f284,plain,
( spl5_6
| spl5_8
| spl5_2 ),
inference(avatar_split_clause,[],[f269,f52,f281,f272]) ).
fof(f285,plain,
( ~ leq(sK1(sK3,sK4,sK2),sK4)
| ~ leq(sK1(sK3,sK4,sK2),sK3)
| ~ spl5_1
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f268,f265]) ).
fof(f286,plain,
( ~ spl5_8
| ~ spl5_7
| ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f285,f52,f48,f276,f281]) ).
fof(f287,plain,
( sK2 = addition(sK1(sK3,sK4,sK2),sK2)
| ~ spl5_6 ),
inference(resolution,[],[f274,f32]) ).
fof(f288,plain,
( sK2 = addition(sK2,sK1(sK3,sK4,sK2))
| ~ spl5_6 ),
inference(forward_demodulation,[],[f287,f20]) ).
fof(f289,plain,
( sK3 != addition(sK1(sK3,sK4,sK2),sK3)
| spl5_8 ),
inference(resolution,[],[f282,f31]) ).
fof(f290,plain,
( sK3 != addition(sK3,sK1(sK3,sK4,sK2))
| spl5_8 ),
inference(forward_demodulation,[],[f289,f20]) ).
fof(f291,plain,
( ! [X0] : addition(sK2,addition(sK1(sK3,sK4,sK2),X0)) = addition(sK2,X0)
| ~ spl5_6 ),
inference(superposition,[],[f21,f288]) ).
fof(f331,plain,
( ! [X0] : addition(sK4,X0) = addition(sK4,addition(sK2,X0))
| ~ spl5_5 ),
inference(superposition,[],[f72,f233]) ).
fof(f356,plain,
( ! [X0] : addition(sK4,X0) = addition(sK2,addition(X0,sK4))
| ~ spl5_5 ),
inference(forward_demodulation,[],[f331,f82]) ).
fof(f376,plain,
( ! [X0] : addition(X0,sK3) = addition(sK2,addition(X0,sK3))
| ~ spl5_4 ),
inference(superposition,[],[f247,f20]) ).
fof(f1868,plain,
( addition(sK2,sK3) = addition(sK1(sK3,sK4,sK2),sK3)
| ~ spl5_4
| ~ spl5_6 ),
inference(superposition,[],[f291,f376]) ).
fof(f1873,plain,
( addition(sK2,sK4) = addition(sK4,sK1(sK3,sK4,sK2))
| ~ spl5_5
| ~ spl5_6 ),
inference(superposition,[],[f356,f291]) ).
fof(f1894,plain,
( sK4 = addition(sK4,sK1(sK3,sK4,sK2))
| ~ spl5_5
| ~ spl5_6 ),
inference(forward_demodulation,[],[f1873,f233]) ).
fof(f1898,plain,
( addition(sK2,sK3) = addition(sK3,sK1(sK3,sK4,sK2))
| ~ spl5_4
| ~ spl5_6 ),
inference(forward_demodulation,[],[f1868,f20]) ).
fof(f1915,plain,
( sK3 = addition(sK3,sK1(sK3,sK4,sK2))
| ~ spl5_4
| ~ spl5_6 ),
inference(forward_demodulation,[],[f1898,f216]) ).
fof(f1922,plain,
( $false
| ~ spl5_4
| ~ spl5_6
| spl5_8 ),
inference(forward_subsumption_resolution,[],[f1915,f290]) ).
fof(f1923,plain,
( ~ spl5_4
| ~ spl5_6
| spl5_8 ),
inference(avatar_contradiction_clause,[],[f1922]) ).
fof(f1925,plain,
( sK4 != addition(sK1(sK3,sK4,sK2),sK4)
| spl5_7 ),
inference(resolution,[],[f277,f31]) ).
fof(f1926,plain,
( sK4 != addition(sK4,sK1(sK3,sK4,sK2))
| spl5_7 ),
inference(forward_demodulation,[],[f1925,f20]) ).
fof(f1927,plain,
( $false
| ~ spl5_5
| ~ spl5_6
| spl5_7 ),
inference(forward_subsumption_resolution,[],[f1926,f1894]) ).
fof(f1928,plain,
( ~ spl5_5
| ~ spl5_6
| spl5_7 ),
inference(avatar_contradiction_clause,[],[f1927]) ).
fof(f1931,plain,
( $false
| ~ spl5_1
| spl5_4 ),
inference(forward_subsumption_resolution,[],[f266,f197]) ).
fof(f1932,plain,
( ~ spl5_1
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f1931]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s2,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f56]) ).
cnf(s3,plain,
( spl5_1
| spl5_3
| ~ spl5_4
| ~ spl5_5 ),
inference(sat_conversion,[],[f202]) ).
cnf(s4,plain,
( ~ spl5_2
| spl5_4 ),
inference(sat_conversion,[],[f211]) ).
cnf(s5,plain,
( ~ spl5_2
| spl5_5 ),
inference(sat_conversion,[],[f227]) ).
cnf(s6,plain,
( ~ spl5_1
| spl5_5 ),
inference(sat_conversion,[],[f232]) ).
cnf(s7,plain,
( spl5_1
| ~ spl5_2
| ~ spl5_3
| ~ spl5_4
| ~ spl5_5 ),
inference(sat_conversion,[],[f264]) ).
cnf(s8,plain,
( spl5_2
| spl5_6
| spl5_7 ),
inference(sat_conversion,[],[f279]) ).
cnf(s9,plain,
( spl5_2
| spl5_6
| spl5_8 ),
inference(sat_conversion,[],[f284]) ).
cnf(s10,plain,
( ~ spl5_1
| spl5_2
| ~ spl5_7
| ~ spl5_8 ),
inference(sat_conversion,[],[f286]) ).
cnf(s14,plain,
( ~ spl5_4
| ~ spl5_6
| spl5_8 ),
inference(sat_conversion,[],[f1923]) ).
cnf(s15,plain,
( ~ spl5_5
| ~ spl5_6
| spl5_7 ),
inference(sat_conversion,[],[f1928]) ).
cnf(s17,plain,
( ~ spl5_1
| spl5_4 ),
inference(sat_conversion,[],[f1932]) ).
cnf(s18,plain,
spl5_1,
inference(rat,[],[s7,s3,s4,s5,s1]) ).
cnf(s19,plain,
spl5_4,
inference(rat,[],[s17,s18]) ).
cnf(s20,plain,
spl5_5,
inference(rat,[],[s6,s18]) ).
cnf(s21,plain,
~ spl5_2,
inference(rat,[],[s2,s18]) ).
cnf(s22,plain,
spl5_6,
inference(rat,[],[s10,s8,s9,s18,s21]) ).
cnf(s23,plain,
spl5_7,
inference(rat,[],[s15,s20,s22]) ).
cnf(s24,plain,
spl5_8,
inference(rat,[],[s14,s19,s22]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s10,s21,s18,s24,s23]) ).
fof(f1933,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KLE029+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.43 % Computer : n009.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Sun Sep 27 13:04:15 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.68/0.62 % (2017105)Will run a generic schedule for satisfiability detection.
% 0.68/0.62 % (2017112)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=873678703:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.68/0.62 % (2017115)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1311120711:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.68/0.62 % (2017111)% WARNING: option uhcvi not known.
% 0.68/0.62 % (2017110)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4063035890_2999 on theBenchmark for (2999ds/0Mi)
% 0.68/0.62 % (2017116)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=122600491:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.68/0.62 % (2017113)dis+10_1_sil=32000:sp=arity:random_seed=2820847129:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.68/0.62 % (2017111)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3036833252:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.68/0.62 % TRYING [1]
% 0.68/0.62 % (2017114)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3012628310:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.68/0.62 % TRYING [2]
% 0.68/0.62 % TRYING [3]
% 0.68/0.62 % TRYING [4]
% 0.68/0.62 % (2017114) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2017105-2017114"...
% 0.68/0.62 % (2017114)...printing done.
% 0.68/0.62 % TRYING [5]
% 0.68/0.62 % (2017114)Refutation found. Thanks to Tanya!
% 0.68/0.62 % SZS status Theorem for theBenchmark
% 0.68/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.62 % (2017114)------------------------------
% 0.68/0.62 % (2017114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.62 % (2017114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.62 % (2017114)CaDiCaL version: 2.1.3
% 0.68/0.62 % (2017114)Termination reason: Refutation
% 0.68/0.62 % (2017114)Time elapsed: 0.076 s
% 0.68/0.62 % (2017114)Peak memory usage: 13 MB
% 0.68/0.62 % (2017114)Instructions burned: 74 (million)
% 0.68/0.62 % (2017105)Success in time 0.118 s
% 0.68/0.62 % Vampire exiting
%------------------------------------------------------------------------------