TSTP Solution File: SEU159+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU159+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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:41 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 111 ( 24 unt; 0 def)
% Number of atoms : 339 ( 80 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 377 ( 149 ~; 161 |; 46 &)
% ( 13 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 182 ( 159 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f149,plain,
$false,
inference(avatar_sat_refutation,[],[f66,f113,f121,f123,f126,f128,f141,f148]) ).
fof(f148,plain,
( spl8_1
| ~ spl8_2
| ~ spl8_3 ),
inference(avatar_contradiction_clause,[],[f147]) ).
fof(f147,plain,
( $false
| spl8_1
| ~ spl8_2
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f146,f60]) ).
fof(f60,plain,
( ~ subset(unordered_pair(sK1,sK2),sK3)
| spl8_1 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl8_1
<=> subset(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f146,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| ~ spl8_2
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f144,f65]) ).
fof(f65,plain,
( in(sK1,sK3)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f63,plain,
( spl8_2
<=> in(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f144,plain,
( ~ in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| ~ spl8_3 ),
inference(superposition,[],[f42,f108]) ).
fof(f108,plain,
( sK1 = sK4(unordered_pair(sK1,sK2),sK3)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f106,plain,
( spl8_3
<=> sK1 = sK4(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f42,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,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])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,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,[],[f20]) ).
fof(f20,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,[],[f13]) ).
fof(f13,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/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f141,plain,
( spl8_1
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| spl8_1
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f139,f60]) ).
fof(f139,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| spl8_1
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f137,f68]) ).
fof(f68,plain,
( in(sK2,sK3)
| spl8_1 ),
inference(subsumption_resolution,[],[f35,f60]) ).
fof(f35,plain,
( in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,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])],[f17,f18]) ).
fof(f18,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(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) ) ),
inference(flattening,[],[f16]) ).
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(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X1,X2)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f137,plain,
( ~ in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| ~ spl8_4 ),
inference(superposition,[],[f42,f112]) ).
fof(f112,plain,
( sK2 = sK4(unordered_pair(sK1,sK2),sK3)
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl8_4
<=> sK2 = sK4(unordered_pair(sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
fof(f128,plain,
( ~ spl8_1
| spl8_2 ),
inference(avatar_contradiction_clause,[],[f127]) ).
fof(f127,plain,
( $false
| ~ spl8_1
| spl8_2 ),
inference(global_subsumption,[],[f64,f36,f48,f47,f46,f51,f52,f37,f39,f55,f34,f38,f71,f53,f72,f75,f73,f77,f74,f78,f76,f70,f54,f41,f42,f88,f40,f50,f43,f95,f94,f56,f57,f98,f102,f103,f104,f35,f61,f115,f119,f118,f117,f124]) ).
fof(f124,plain,
( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f36,f61]) ).
fof(f117,plain,
( in(sK2,sK3)
| ~ spl8_1 ),
inference(resolution,[],[f115,f72]) ).
fof(f118,plain,
( in(sK1,sK3)
| ~ spl8_1 ),
inference(resolution,[],[f115,f74]) ).
fof(f119,plain,
( ! [X0] :
( in(sK4(unordered_pair(sK1,sK2),X0),sK3)
| subset(unordered_pair(sK1,sK2),X0) )
| ~ spl8_1 ),
inference(resolution,[],[f115,f41]) ).
fof(f115,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK1,sK2))
| in(X0,sK3) )
| ~ spl8_1 ),
inference(resolution,[],[f61,f40]) ).
fof(f61,plain,
( subset(unordered_pair(sK1,sK2),sK3)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f104,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,[],[f98,f38]) ).
fof(f103,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,[],[f98,f38]) ).
fof(f102,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,[],[f98,f40]) ).
fof(f98,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,[],[f94,f41]) ).
fof(f57,plain,
! [X2,X0,X1] :
( sK5(X0,X1,X2) != X1
| sP0(X0,X1,X2)
| ~ in(X1,X2) ),
inference(inner_rewriting,[],[f47]) ).
fof(f56,plain,
! [X2,X0,X1] :
( sK5(X0,X1,X2) != X0
| sP0(X0,X1,X2)
| ~ in(X0,X2) ),
inference(inner_rewriting,[],[f48]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ in(X1,unordered_pair(X0,X2))
| X0 = X1
| X1 = X2 ),
inference(resolution,[],[f43,f55]) ).
fof(f95,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ in(X1,unordered_pair(X2,X0))
| X1 = X2 ),
inference(resolution,[],[f43,f70]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( ~ sP0(X0,X1,X2)
| X1 = X4
| ~ in(X4,X2)
| X0 = X4 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,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])],[f26,f27]) ).
fof(f27,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(f26,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,[],[f25]) ).
fof(f25,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,[],[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(nnf_transformation,[],[f14]) ).
fof(f14,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(f50,plain,
! [X2,X0,X1] :
( ~ sP0(X1,X0,X2)
| unordered_pair(X0,X1) = X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,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,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> sP0(X1,X0,X2) ),
inference(definition_folding,[],[f3,f14]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f40,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f88,plain,
! [X0,X1] :
( ~ in(X0,sK4(X0,X1))
| subset(X0,X1) ),
inference(resolution,[],[f41,f39]) ).
fof(f41,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f54,plain,
! [X2,X0,X4] :
( ~ sP0(X0,X4,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f70,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X1,X0)),
inference(superposition,[],[f55,f38]) ).
fof(f76,plain,
! [X0,X1] : ~ in(unordered_pair(X1,X0),X1),
inference(superposition,[],[f73,f38]) ).
fof(f78,plain,
! [X0,X1] : ~ in(unordered_pair(X0,X1),X0),
inference(resolution,[],[f74,f39]) ).
fof(f74,plain,
! [X0,X1] : in(X1,unordered_pair(X1,X0)),
inference(superposition,[],[f72,f38]) ).
fof(f77,plain,
! [X0,X1] : ~ in(unordered_pair(X1,X0),X1),
inference(superposition,[],[f73,f38]) ).
fof(f73,plain,
! [X0,X1] : ~ in(unordered_pair(X0,X1),X1),
inference(resolution,[],[f72,f39]) ).
fof(f75,plain,
! [X0,X1] : in(X1,unordered_pair(X1,X0)),
inference(superposition,[],[f72,f38]) ).
fof(f72,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(resolution,[],[f53,f55]) ).
fof(f53,plain,
! [X2,X1,X4] :
( ~ sP0(X4,X1,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f71,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X1,X0)),
inference(superposition,[],[f55,f38]) ).
fof(f38,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/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f34,plain,
( in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f19]) ).
fof(f55,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X0,X1)),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f39,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,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/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f37,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f52,plain,
empty(sK7),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
empty(sK7),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f5,f32]) ).
fof(f32,plain,
( ? [X0] : empty(X0)
=> empty(sK7) ),
introduced(choice_axiom,[]) ).
fof(f5,axiom,
? [X0] : empty(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(f51,plain,
~ empty(sK6),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
~ empty(sK6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f6,f30]) ).
fof(f30,plain,
( ? [X0] : ~ empty(X0)
=> ~ empty(sK6) ),
introduced(choice_axiom,[]) ).
fof(f6,axiom,
? [X0] : ~ empty(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f46,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,[],[f28]) ).
fof(f47,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| sK5(X0,X1,X2) != X1
| ~ in(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f48,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| sK5(X0,X1,X2) != X0
| ~ in(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f36,plain,
( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) ),
inference(cnf_transformation,[],[f19]) ).
fof(f64,plain,
( ~ in(sK1,sK3)
| spl8_2 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f126,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f125,plain,
( $false
| ~ spl8_1 ),
inference(global_subsumption,[],[f36,f48,f47,f46,f51,f52,f37,f39,f55,f34,f38,f71,f53,f72,f75,f73,f77,f74,f78,f76,f70,f54,f41,f42,f88,f40,f50,f43,f95,f94,f56,f57,f98,f102,f103,f104,f35,f61,f115,f119,f118,f117,f124]) ).
fof(f123,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f122]) ).
fof(f122,plain,
( $false
| ~ spl8_1 ),
inference(global_subsumption,[],[f36,f48,f47,f46,f51,f52,f37,f39,f55,f34,f38,f71,f53,f72,f75,f73,f77,f74,f78,f76,f70,f54,f41,f42,f88,f40,f50,f43,f95,f94,f56,f57,f98,f102,f103,f104,f35,f61,f115,f119,f118,f117]) ).
fof(f121,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f120,plain,
( $false
| ~ spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f117,f116]) ).
fof(f116,plain,
( ~ in(sK2,sK3)
| ~ spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f114,f61]) ).
fof(f114,plain,
( ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3)
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f36,f65]) ).
fof(f113,plain,
( spl8_3
| spl8_4
| spl8_1 ),
inference(avatar_split_clause,[],[f101,f59,f110,f106]) ).
fof(f101,plain,
( sK2 = sK4(unordered_pair(sK1,sK2),sK3)
| sK1 = sK4(unordered_pair(sK1,sK2),sK3)
| spl8_1 ),
inference(resolution,[],[f98,f60]) ).
fof(f66,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f34,f63,f59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU159+3 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Apr 29 20:19:59 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.15/0.31 % (7382)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.35 % (7388)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.15/0.35 % (7385)WARNING: value z3 for option sas not known
% 0.15/0.35 % (7386)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.36 TRYING [1]
% 0.15/0.36 TRYING [2]
% 0.15/0.36 % (7385)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.15/0.36 TRYING [3]
% 0.15/0.36 % (7385)First to succeed.
% 0.15/0.37 % (7383)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37 TRYING [4]
% 0.15/0.37 % (7384)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.38 TRYING [5]
% 0.15/0.38 % (7389)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.15/0.39 % (7385)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (7385)------------------------------
% 0.15/0.39 % (7385)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (7385)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (7385)Memory used [KB]: 873
% 0.15/0.39 % (7385)Time elapsed: 0.039 s
% 0.15/0.39 % (7385)Instructions burned: 11 (million)
% 0.15/0.39 % (7385)------------------------------
% 0.15/0.39 % (7385)------------------------------
% 0.15/0.39 % (7382)Success in time 0.072 s
%------------------------------------------------------------------------------