TSTP Solution File: SEU146+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU146+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n024.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 : Wed Aug 31 18:32:08 EDT 2022
% Result : Theorem 1.55s 0.60s
% Output : Refutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 22
% Syntax : Number of formulae : 114 ( 14 unt; 0 def)
% Number of atoms : 399 ( 127 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 455 ( 170 ~; 191 |; 69 &)
% ( 17 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 170 ( 147 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f881,plain,
$false,
inference(avatar_sat_refutation,[],[f378,f380,f382,f856,f860,f880]) ).
fof(f880,plain,
( ~ spl15_1
| spl15_2 ),
inference(avatar_contradiction_clause,[],[f879]) ).
fof(f879,plain,
( $false
| ~ spl15_1
| spl15_2 ),
inference(subsumption_resolution,[],[f861,f347]) ).
fof(f347,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f251]) ).
fof(f251,plain,
! [X0,X1] :
( subset(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f166]) ).
fof(f166,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f165]) ).
fof(f165,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f861,plain,
( ~ subset(sK9,sK9)
| ~ spl15_1
| spl15_2 ),
inference(superposition,[],[f372,f369]) ).
fof(f369,plain,
( sK9 = sF14
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f367,plain,
( spl15_1
<=> sK9 = sF14 ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
fof(f372,plain,
( ~ subset(sK9,sF14)
| spl15_2 ),
inference(avatar_component_clause,[],[f371]) ).
fof(f371,plain,
( spl15_2
<=> subset(sK9,sF14) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
fof(f860,plain,
( spl15_2
| ~ spl15_3 ),
inference(avatar_contradiction_clause,[],[f859]) ).
fof(f859,plain,
( $false
| spl15_2
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f858,f271]) ).
fof(f271,plain,
empty(empty_set),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f858,plain,
( ~ empty(empty_set)
| spl15_2
| ~ spl15_3 ),
inference(forward_demodulation,[],[f857,f377]) ).
fof(f377,plain,
( empty_set = sK9
| ~ spl15_3 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f375,plain,
( spl15_3
<=> empty_set = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl15_3])]) ).
fof(f857,plain,
( ~ empty(sK9)
| spl15_2 ),
inference(resolution,[],[f372,f643]) ).
fof(f643,plain,
! [X3,X4] :
( subset(X3,X4)
| ~ empty(X3) ),
inference(resolution,[],[f223,f245]) ).
fof(f245,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ empty(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ empty(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
~ ( in(X1,X0)
& empty(X0) ),
inference(rectify,[],[f64]) ).
fof(f64,axiom,
! [X1,X0] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f223,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f144,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
=> ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) )
& ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f856,plain,
( spl15_1
| ~ spl15_2
| spl15_3 ),
inference(avatar_contradiction_clause,[],[f855]) ).
fof(f855,plain,
( $false
| spl15_1
| ~ spl15_2
| spl15_3 ),
inference(subsumption_resolution,[],[f838,f368]) ).
fof(f368,plain,
( sK9 != sF14
| spl15_1 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f838,plain,
( sK9 = sF14
| ~ spl15_2
| spl15_3 ),
inference(superposition,[],[f818,f603]) ).
fof(f603,plain,
( set_union2(sK9,sF14) = sF14
| ~ spl15_2 ),
inference(resolution,[],[f379,f373]) ).
fof(f373,plain,
( subset(sK9,sF14)
| ~ spl15_2 ),
inference(avatar_component_clause,[],[f371]) ).
fof(f379,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(forward_demodulation,[],[f262,f268]) ).
fof(f268,plain,
! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
inference(rectify,[],[f51]) ).
fof(f51,axiom,
! [X1,X0] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f262,plain,
! [X0,X1] :
( set_union2(X0,set_difference(X1,X0)) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0,X1] :
( set_union2(X0,set_difference(X1,X0)) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,set_difference(X1,X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f818,plain,
( sK9 = set_union2(sK9,sF14)
| ~ spl15_2
| spl15_3 ),
inference(superposition,[],[f244,f808]) ).
fof(f808,plain,
( sK9 = set_union2(sF14,sK9)
| ~ spl15_2
| spl15_3 ),
inference(resolution,[],[f803,f379]) ).
fof(f803,plain,
( subset(sF14,sK9)
| ~ spl15_2
| spl15_3 ),
inference(resolution,[],[f797,f545]) ).
fof(f545,plain,
! [X0] :
( ~ in(sK8,X0)
| subset(sF14,X0) ),
inference(superposition,[],[f340,f361]) ).
fof(f361,plain,
unordered_pair(sK8,sK8) = sF14,
introduced(function_definition,[]) ).
fof(f340,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f307,f309]) ).
fof(f309,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f62,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f307,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f211,plain,
! [X0,X1] :
( ( in(X0,X1)
| ~ subset(singleton(X0),X1) )
& ( subset(singleton(X0),X1)
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0,X1] :
( in(X0,X1)
<=> subset(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f797,plain,
( in(sK8,sK9)
| ~ spl15_2
| spl15_3 ),
inference(subsumption_resolution,[],[f796,f376]) ).
fof(f376,plain,
( empty_set != sK9
| spl15_3 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f796,plain,
( empty_set = sK9
| in(sK8,sK9)
| ~ spl15_2
| spl15_3 ),
inference(superposition,[],[f219,f790]) ).
fof(f790,plain,
( sK8 = sK1(sK9)
| ~ spl15_2
| spl15_3 ),
inference(resolution,[],[f789,f565]) ).
fof(f565,plain,
! [X0] :
( ~ in(X0,sF14)
| sK8 = X0 ),
inference(superposition,[],[f357,f361]) ).
fof(f357,plain,
! [X2,X1] :
( ~ in(X2,unordered_pair(X1,X1))
| X1 = X2 ),
inference(equality_resolution,[],[f330]) ).
fof(f330,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ in(X2,X0)
| unordered_pair(X1,X1) != X0 ),
inference(definition_unfolding,[],[f296,f309]) ).
fof(f296,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ in(X2,X0)
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f204]) ).
fof(f204,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X0)
| X1 != X2 )
& ( X1 = X2
| ~ in(X2,X0) ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ( ( sK12(X0,X1) != X1
| ~ in(sK12(X0,X1),X0) )
& ( sK12(X0,X1) = X1
| in(sK12(X0,X1),X0) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f202,f203]) ).
fof(f203,plain,
! [X0,X1] :
( ? [X3] :
( ( X1 != X3
| ~ in(X3,X0) )
& ( X1 = X3
| in(X3,X0) ) )
=> ( ( sK12(X0,X1) != X1
| ~ in(sK12(X0,X1),X0) )
& ( sK12(X0,X1) = X1
| in(sK12(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f202,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X0)
| X1 != X2 )
& ( X1 = X2
| ~ in(X2,X0) ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ? [X3] :
( ( X1 != X3
| ~ in(X3,X0) )
& ( X1 = X3
| in(X3,X0) ) ) ) ),
inference(rectify,[],[f201]) ).
fof(f201,plain,
! [X1,X0] :
( ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
<=> X0 = X2 )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f789,plain,
( in(sK1(sK9),sF14)
| ~ spl15_2
| spl15_3 ),
inference(subsumption_resolution,[],[f785,f376]) ).
fof(f785,plain,
( empty_set = sK9
| in(sK1(sK9),sF14)
| ~ spl15_2 ),
inference(resolution,[],[f770,f219]) ).
fof(f770,plain,
( ! [X15] :
( ~ in(X15,sK9)
| in(X15,sF14) )
| ~ spl15_2 ),
inference(superposition,[],[f352,f603]) ).
fof(f352,plain,
! [X2,X3,X0] :
( in(X3,set_union2(X0,X2))
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f290]) ).
fof(f290,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| set_union2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X0)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X2)
| ~ in(X3,X1) ) )
| set_union2(X0,X2) != X1 )
& ( set_union2(X0,X2) = X1
| ( ( ( ~ in(sK10(X0,X1,X2),X0)
& ~ in(sK10(X0,X1,X2),X2) )
| ~ in(sK10(X0,X1,X2),X1) )
& ( in(sK10(X0,X1,X2),X0)
| in(sK10(X0,X1,X2),X2)
| in(sK10(X0,X1,X2),X1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f195,f196]) ).
fof(f196,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ( ~ in(X4,X0)
& ~ in(X4,X2) )
| ~ in(X4,X1) )
& ( in(X4,X0)
| in(X4,X2)
| in(X4,X1) ) )
=> ( ( ( ~ in(sK10(X0,X1,X2),X0)
& ~ in(sK10(X0,X1,X2),X2) )
| ~ in(sK10(X0,X1,X2),X1) )
& ( in(sK10(X0,X1,X2),X0)
| in(sK10(X0,X1,X2),X2)
| in(sK10(X0,X1,X2),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f195,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X0)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X2)
| ~ in(X3,X1) ) )
| set_union2(X0,X2) != X1 )
& ( set_union2(X0,X2) = X1
| ? [X4] :
( ( ( ~ in(X4,X0)
& ~ in(X4,X2) )
| ~ in(X4,X1) )
& ( in(X4,X0)
| in(X4,X2)
| in(X4,X1) ) ) ) ),
inference(rectify,[],[f194]) ).
fof(f194,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X1,X0) != X2 )
& ( set_union2(X1,X0) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) ) ),
inference(flattening,[],[f193]) ).
fof(f193,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X1,X0) != X2 )
& ( set_union2(X1,X0) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X1,X2,X0] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) )
<=> set_union2(X1,X0) = X2 ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X0,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
| in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f219,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| in(sK1(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f140,f141]) ).
fof(f141,plain,
! [X0] :
( ? [X2] : in(X2,X0)
=> in(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X2] : in(X2,X0) ) ),
inference(rectify,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X1] : in(X1,X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( ! [X1] : ~ in(X1,X0)
<=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f244,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(rectify,[],[f85]) ).
fof(f85,plain,
! [X1,X0] : set_union2(X0,X1) = set_union2(X1,X0),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f382,plain,
( ~ spl15_2
| ~ spl15_3 ),
inference(avatar_split_clause,[],[f363,f375,f371]) ).
fof(f363,plain,
( empty_set != sK9
| ~ subset(sK9,sF14) ),
inference(definition_folding,[],[f324,f361]) ).
fof(f324,plain,
( empty_set != sK9
| ~ subset(sK9,unordered_pair(sK8,sK8)) ),
inference(definition_unfolding,[],[f274,f309]) ).
fof(f274,plain,
( empty_set != sK9
| ~ subset(sK9,singleton(sK8)) ),
inference(cnf_transformation,[],[f187]) ).
fof(f187,plain,
( ( ( singleton(sK8) != sK9
& empty_set != sK9 )
| ~ subset(sK9,singleton(sK8)) )
& ( singleton(sK8) = sK9
| empty_set = sK9
| subset(sK9,singleton(sK8)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f185,f186]) ).
fof(f186,plain,
( ? [X0,X1] :
( ( ( singleton(X0) != X1
& empty_set != X1 )
| ~ subset(X1,singleton(X0)) )
& ( singleton(X0) = X1
| empty_set = X1
| subset(X1,singleton(X0)) ) )
=> ( ( ( singleton(sK8) != sK9
& empty_set != sK9 )
| ~ subset(sK9,singleton(sK8)) )
& ( singleton(sK8) = sK9
| empty_set = sK9
| subset(sK9,singleton(sK8)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f185,plain,
? [X0,X1] :
( ( ( singleton(X0) != X1
& empty_set != X1 )
| ~ subset(X1,singleton(X0)) )
& ( singleton(X0) = X1
| empty_set = X1
| subset(X1,singleton(X0)) ) ),
inference(rectify,[],[f184]) ).
fof(f184,plain,
? [X1,X0] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f183]) ).
fof(f183,plain,
? [X1,X0] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
? [X1,X0] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X1,X0] :
( ( singleton(X1) = X0
| empty_set = X0 )
<=> subset(X0,singleton(X1)) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X1,X0] :
( ( singleton(X1) = X0
| empty_set = X0 )
<=> subset(X0,singleton(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f380,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f362,f371,f367]) ).
fof(f362,plain,
( ~ subset(sK9,sF14)
| sK9 != sF14 ),
inference(definition_folding,[],[f323,f361,f361]) ).
fof(f323,plain,
( unordered_pair(sK8,sK8) != sK9
| ~ subset(sK9,unordered_pair(sK8,sK8)) ),
inference(definition_unfolding,[],[f275,f309,f309]) ).
fof(f275,plain,
( singleton(sK8) != sK9
| ~ subset(sK9,singleton(sK8)) ),
inference(cnf_transformation,[],[f187]) ).
fof(f378,plain,
( spl15_1
| spl15_2
| spl15_3 ),
inference(avatar_split_clause,[],[f364,f375,f371,f367]) ).
fof(f364,plain,
( empty_set = sK9
| subset(sK9,sF14)
| sK9 = sF14 ),
inference(definition_folding,[],[f325,f361,f361]) ).
fof(f325,plain,
( unordered_pair(sK8,sK8) = sK9
| empty_set = sK9
| subset(sK9,unordered_pair(sK8,sK8)) ),
inference(definition_unfolding,[],[f273,f309,f309]) ).
fof(f273,plain,
( singleton(sK8) = sK9
| empty_set = sK9
| subset(sK9,singleton(sK8)) ),
inference(cnf_transformation,[],[f187]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU146+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n024.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 : Tue Aug 30 14:46:19 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.53 % (3288)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54 % (3289)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (3304)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.54 % (3298)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.54 % (3287)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.54 TRYING [1]
% 0.21/0.54 TRYING [2]
% 0.21/0.54 % (3296)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.34/0.55 % (3305)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.34/0.55 % (3295)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.34/0.55 % (3285)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.34/0.55 TRYING [3]
% 1.34/0.55 % (3311)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.34/0.56 % (3297)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.34/0.56 % (3289)Instruction limit reached!
% 1.34/0.56 % (3289)------------------------------
% 1.34/0.56 % (3289)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.34/0.56 % (3289)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.34/0.56 % (3289)Termination reason: Unknown
% 1.34/0.56 % (3289)Termination phase: Saturation
% 1.34/0.56
% 1.34/0.56 % (3289)Memory used [KB]: 5628
% 1.34/0.56 % (3289)Time elapsed: 0.135 s
% 1.34/0.56 % (3289)Instructions burned: 7 (million)
% 1.34/0.56 % (3289)------------------------------
% 1.34/0.56 % (3289)------------------------------
% 1.34/0.56 % (3293)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.34/0.56 % (3308)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.34/0.56 % (3282)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.55/0.56 % (3306)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.55/0.56 % (3290)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.55/0.56 % (3290)Instruction limit reached!
% 1.55/0.56 % (3290)------------------------------
% 1.55/0.56 % (3290)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.55/0.56 % (3290)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.56 % (3290)Termination reason: Unknown
% 1.55/0.56 % (3290)Termination phase: Preprocessing 3
% 1.55/0.56
% 1.55/0.56 % (3290)Memory used [KB]: 1023
% 1.55/0.56 % (3290)Time elapsed: 0.002 s
% 1.55/0.56 % (3290)Instructions burned: 3 (million)
% 1.55/0.56 % (3290)------------------------------
% 1.55/0.56 % (3290)------------------------------
% 1.55/0.56 % (3286)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.55/0.57 % (3284)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.55/0.57 % (3301)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.55/0.57 % (3309)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.55/0.57 % (3310)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.55/0.57 % (3300)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.55/0.58 TRYING [1]
% 1.55/0.58 TRYING [2]
% 1.55/0.58 % (3299)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.55/0.58 % (3307)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.55/0.58 % (3303)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.55/0.58 % (3291)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.55/0.58 % (3292)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.55/0.58 % (3283)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.55/0.58 TRYING [3]
% 1.55/0.59 % (3288)Instruction limit reached!
% 1.55/0.59 % (3288)------------------------------
% 1.55/0.59 % (3288)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.55/0.59 % (3288)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.59 % (3288)Termination reason: Unknown
% 1.55/0.59 % (3288)Termination phase: Finite model building constraint generation
% 1.55/0.59
% 1.55/0.59 % (3288)Memory used [KB]: 7419
% 1.55/0.59 % (3288)Time elapsed: 0.130 s
% 1.55/0.59 % (3288)Instructions burned: 52 (million)
% 1.55/0.59 % (3288)------------------------------
% 1.55/0.59 % (3288)------------------------------
% 1.55/0.59 % (3294)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.55/0.59 % (3295)First to succeed.
% 1.55/0.60 % (3295)Refutation found. Thanks to Tanya!
% 1.55/0.60 % SZS status Theorem for theBenchmark
% 1.55/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.55/0.60 % (3295)------------------------------
% 1.55/0.60 % (3295)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.55/0.60 % (3295)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.60 % (3295)Termination reason: Refutation
% 1.55/0.60
% 1.55/0.60 % (3295)Memory used [KB]: 5756
% 1.55/0.60 % (3295)Time elapsed: 0.177 s
% 1.55/0.60 % (3295)Instructions burned: 21 (million)
% 1.55/0.60 % (3295)------------------------------
% 1.55/0.60 % (3295)------------------------------
% 1.55/0.60 % (3281)Success in time 0.227 s
%------------------------------------------------------------------------------