TSTP Solution File: SEU159+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Apr 30 15:22:40 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 19 unt; 0 def)
% Number of atoms : 330 ( 80 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 370 ( 144 ~; 161 |; 46 &)
% ( 13 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 180 ( 161 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f142,plain,
$false,
inference(avatar_sat_refutation,[],[f59,f106,f114,f116,f119,f121,f134,f141]) ).
fof(f141,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f139,f53]) ).
fof(f53,plain,
( ~ subset(unordered_pair(sK1,sK2),sK3)
| spl6_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f52,plain,
( spl6_1
<=> subset(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f139,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f137,f58]) ).
fof(f58,plain,
( in(sK1,sK3)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f56,plain,
( spl6_2
<=> in(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f137,plain,
( ~ in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| ~ spl6_3 ),
inference(superposition,[],[f37,f101]) ).
fof(f101,plain,
( sK1 = sK4(unordered_pair(sK1,sK2),sK3)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f99,plain,
( spl6_3
<=> sK1 = sK4(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f37,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f134,plain,
( spl6_1
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f133,plain,
( $false
| spl6_1
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f132,f53]) ).
fof(f132,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| spl6_1
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f130,f61]) ).
fof(f61,plain,
( in(sK2,sK3)
| spl6_1 ),
inference(subsumption_resolution,[],[f30,f53]) ).
fof(f30,plain,
( in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) )
& ( ( in(sK2,sK3)
& in(sK1,sK3) )
| subset(unordered_pair(sK1,sK2),sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f16,f17]) ).
fof(f17,plain,
( ? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| ~ subset(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| subset(unordered_pair(X0,X1),X2) ) )
=> ( ( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) )
& ( ( in(sK2,sK3)
& in(sK1,sK3) )
| subset(unordered_pair(sK1,sK2),sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| ~ subset(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| ~ subset(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X1,X2)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f130,plain,
( ~ in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| ~ spl6_4 ),
inference(superposition,[],[f37,f105]) ).
fof(f105,plain,
( sK2 = sK4(unordered_pair(sK1,sK2),sK3)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f103,plain,
( spl6_4
<=> sK2 = sK4(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f121,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f120,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(global_subsumption,[],[f57,f31,f43,f42,f41,f32,f34,f48,f29,f33,f64,f63,f46,f67,f70,f71,f68,f69,f75,f76,f72,f47,f36,f37,f81,f35,f45,f38,f88,f87,f49,f50,f91,f95,f96,f97,f30,f54,f108,f112,f111,f110,f117]) ).
fof(f117,plain,
( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f31,f54]) ).
fof(f110,plain,
( in(sK2,sK3)
| ~ spl6_1 ),
inference(resolution,[],[f108,f67]) ).
fof(f111,plain,
( in(sK1,sK3)
| ~ spl6_1 ),
inference(resolution,[],[f108,f68]) ).
fof(f112,plain,
( ! [X0] :
( in(sK4(unordered_pair(sK1,sK2),X0),sK3)
| subset(unordered_pair(sK1,sK2),X0) )
| ~ spl6_1 ),
inference(resolution,[],[f108,f36]) ).
fof(f108,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK1,sK2))
| in(X0,sK3) )
| ~ spl6_1 ),
inference(resolution,[],[f54,f35]) ).
fof(f54,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f97,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X1,X0),X2)
| sK4(unordered_pair(X0,X1),X2) = X1
| sK4(unordered_pair(X0,X1),X2) = X0 ),
inference(superposition,[],[f91,f33]) ).
fof(f96,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X1,X0),X2)
| sK4(unordered_pair(X0,X1),X2) = X1
| sK4(unordered_pair(X0,X1),X2) = X0 ),
inference(superposition,[],[f91,f33]) ).
fof(f95,plain,
! [X2,X3,X0,X1] :
( sK4(unordered_pair(X0,X1),X2) = X1
| sK4(unordered_pair(X0,X1),X2) = X0
| ~ in(X3,unordered_pair(X0,X1))
| in(X3,X2) ),
inference(resolution,[],[f91,f35]) ).
fof(f91,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| sK4(unordered_pair(X0,X1),X2) = X1
| sK4(unordered_pair(X0,X1),X2) = X0 ),
inference(resolution,[],[f87,f36]) ).
fof(f50,plain,
! [X2,X0,X1] :
( sK5(X0,X1,X2) != X1
| sP0(X0,X1,X2)
| ~ in(X1,X2) ),
inference(inner_rewriting,[],[f42]) ).
fof(f49,plain,
! [X2,X0,X1] :
( sK5(X0,X1,X2) != X0
| sP0(X0,X1,X2)
| ~ in(X0,X2) ),
inference(inner_rewriting,[],[f43]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ in(X1,unordered_pair(X0,X2))
| X0 = X1
| X1 = X2 ),
inference(resolution,[],[f38,f48]) ).
fof(f88,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ in(X1,unordered_pair(X2,X0))
| X1 = X2 ),
inference(resolution,[],[f38,f63]) ).
fof(f38,plain,
! [X2,X0,X1,X4] :
( ~ sP0(X0,X1,X2)
| X1 = X4
| ~ in(X4,X2)
| X0 = X4 ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( ( ( sK5(X0,X1,X2) != X0
& sK5(X0,X1,X2) != X1 )
| ~ in(sK5(X0,X1,X2),X2) )
& ( sK5(X0,X1,X2) = X0
| sK5(X0,X1,X2) = X1
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f25,f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) )
=> ( ( ( sK5(X0,X1,X2) != X0
& sK5(X0,X1,X2) != X1 )
| ~ in(sK5(X0,X1,X2),X2) )
& ( sK5(X0,X1,X2) = X0
| sK5(X0,X1,X2) = X1
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,X2)
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,X2)
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0,X2] :
( sP0(X1,X0,X2)
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ~ sP0(X1,X0,X2)
| unordered_pair(X0,X1) = X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ~ sP0(X1,X0,X2) )
& ( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> sP0(X1,X0,X2) ),
inference(definition_folding,[],[f3,f13]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f35,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f81,plain,
! [X0,X1] :
( ~ in(X0,sK4(X0,X1))
| subset(X0,X1) ),
inference(resolution,[],[f36,f34]) ).
fof(f36,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f47,plain,
! [X2,X0,X4] :
( ~ sP0(X0,X4,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f39]) ).
fof(f39,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f72,plain,
! [X0,X1] : ~ in(unordered_pair(X0,X1),X0),
inference(resolution,[],[f68,f34]) ).
fof(f76,plain,
! [X0,X1] : ~ in(unordered_pair(X1,X0),X1),
inference(superposition,[],[f69,f33]) ).
fof(f75,plain,
! [X0,X1] : ~ in(unordered_pair(X1,X0),X1),
inference(superposition,[],[f69,f33]) ).
fof(f69,plain,
! [X0,X1] : ~ in(unordered_pair(X0,X1),X1),
inference(resolution,[],[f67,f34]) ).
fof(f68,plain,
! [X0,X1] : in(X0,unordered_pair(X0,X1)),
inference(resolution,[],[f46,f63]) ).
fof(f71,plain,
! [X0,X1] : in(X1,unordered_pair(X1,X0)),
inference(superposition,[],[f67,f33]) ).
fof(f70,plain,
! [X0,X1] : in(X1,unordered_pair(X1,X0)),
inference(superposition,[],[f67,f33]) ).
fof(f67,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(resolution,[],[f46,f48]) ).
fof(f46,plain,
! [X2,X1,X4] :
( ~ sP0(X4,X1,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f63,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X1,X0)),
inference(superposition,[],[f48,f33]) ).
fof(f64,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X1,X0)),
inference(superposition,[],[f48,f33]) ).
fof(f33,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f29,plain,
( in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f48,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X0,X1)),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X2,X0,X1] :
( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f32,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f41,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| sK5(X0,X1,X2) = X0
| sK5(X0,X1,X2) = X1
| in(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| sK5(X0,X1,X2) != X1
| ~ in(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| sK5(X0,X1,X2) != X0
| ~ in(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f31,plain,
( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f57,plain,
( ~ in(sK1,sK3)
| spl6_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f119,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f118,plain,
( $false
| ~ spl6_1 ),
inference(global_subsumption,[],[f31,f43,f42,f41,f32,f34,f48,f29,f33,f64,f63,f46,f67,f70,f71,f68,f69,f75,f76,f72,f47,f36,f37,f81,f35,f45,f38,f88,f87,f49,f50,f91,f95,f96,f97,f30,f54,f108,f112,f111,f110,f117]) ).
fof(f116,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f115,plain,
( $false
| ~ spl6_1 ),
inference(global_subsumption,[],[f31,f43,f42,f41,f32,f34,f48,f29,f33,f64,f63,f46,f67,f70,f71,f68,f69,f75,f76,f72,f47,f36,f37,f81,f35,f45,f38,f88,f87,f49,f50,f91,f95,f96,f97,f30,f54,f108,f112,f111,f110]) ).
fof(f114,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f113,plain,
( $false
| ~ spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f110,f109]) ).
fof(f109,plain,
( ~ in(sK2,sK3)
| ~ spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f107,f54]) ).
fof(f107,plain,
( ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3)
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f31,f58]) ).
fof(f106,plain,
( spl6_3
| spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f94,f52,f103,f99]) ).
fof(f94,plain,
( sK2 = sK4(unordered_pair(sK1,sK2),sK3)
| sK1 = sK4(unordered_pair(sK1,sK2),sK3)
| spl6_1 ),
inference(resolution,[],[f91,f53]) ).
fof(f59,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f29,f56,f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 20:32:11 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (23775)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (23776)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (23781)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38 % (23778)WARNING: value z3 for option sas not known
% 0.14/0.38 TRYING [1]
% 0.14/0.38 % (23780)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38 % (23777)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (23779)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (23778)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (23782)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 % (23778)First to succeed.
% 0.14/0.39 TRYING [3]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.40 % (23778)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (23778)------------------------------
% 0.14/0.40 % (23778)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.40 % (23778)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (23778)Memory used [KB]: 872
% 0.14/0.40 % (23778)Time elapsed: 0.012 s
% 0.14/0.40 % (23778)Instructions burned: 11 (million)
% 0.14/0.40 % (23778)------------------------------
% 0.14/0.40 % (23778)------------------------------
% 0.14/0.40 % (23775)Success in time 0.038 s
%------------------------------------------------------------------------------