TSTP Solution File: SEU168+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU168+3 : TPTP v8.1.0. Released v3.2.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 : n018.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:18 EDT 2022
% Result : Theorem 1.82s 0.59s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of formulae : 79 ( 6 unt; 0 def)
% Number of atoms : 394 ( 9 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 493 ( 178 ~; 166 |; 122 &)
% ( 7 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 214 ( 162 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f241,plain,
$false,
inference(subsumption_resolution,[],[f239,f188]) ).
fof(f188,plain,
~ in(sK6(sK4(sK8)),sK4(sK8)),
inference(resolution,[],[f184,f64]) ).
fof(f64,plain,
! [X0] :
( ~ sP0(X0)
| ~ in(sK6(X0),X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0] :
( ( ~ in(sK6(X0),X0)
& subset(sK6(X0),sK7(X0))
& in(sK7(X0),X0) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f38,f39]) ).
fof(f39,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X1,X0)
& subset(X1,X2)
& in(X2,X0) )
=> ( ~ in(sK6(X0),X0)
& subset(sK6(X0),sK7(X0))
& in(sK7(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X1,X0)
& subset(X1,X2)
& in(X2,X0) )
| ~ sP0(X0) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X4,X1)
& subset(X4,X5)
& in(X5,X1) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X4,X1)
& subset(X4,X5)
& in(X5,X1) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f184,plain,
sP0(sK4(sK8)),
inference(subsumption_resolution,[],[f183,f57]) ).
fof(f57,plain,
! [X0] : in(X0,sK4(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ! [X2,X3] :
( ~ in(X2,sK4(X0))
| ~ subset(X3,X2)
| in(X3,sK4(X0)) )
& ! [X4] :
( ~ in(X4,sK4(X0))
| ( ! [X6] :
( ~ subset(X6,X4)
| in(X6,sK5(X0,X4)) )
& in(sK5(X0,X4),sK4(X0)) ) )
& ! [X7] :
( are_equipotent(X7,sK4(X0))
| ~ subset(X7,sK4(X0))
| in(X7,sK4(X0)) )
& in(X0,sK4(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f33,f35,f34]) ).
fof(f34,plain,
! [X0] :
( ? [X1] :
( ! [X2,X3] :
( ~ in(X2,X1)
| ~ subset(X3,X2)
| in(X3,X1) )
& ! [X4] :
( ~ in(X4,X1)
| ? [X5] :
( ! [X6] :
( ~ subset(X6,X4)
| in(X6,X5) )
& in(X5,X1) ) )
& ! [X7] :
( are_equipotent(X7,X1)
| ~ subset(X7,X1)
| in(X7,X1) )
& in(X0,X1) )
=> ( ! [X3,X2] :
( ~ in(X2,sK4(X0))
| ~ subset(X3,X2)
| in(X3,sK4(X0)) )
& ! [X4] :
( ~ in(X4,sK4(X0))
| ? [X5] :
( ! [X6] :
( ~ subset(X6,X4)
| in(X6,X5) )
& in(X5,sK4(X0)) ) )
& ! [X7] :
( are_equipotent(X7,sK4(X0))
| ~ subset(X7,sK4(X0))
| in(X7,sK4(X0)) )
& in(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0,X4] :
( ? [X5] :
( ! [X6] :
( ~ subset(X6,X4)
| in(X6,X5) )
& in(X5,sK4(X0)) )
=> ( ! [X6] :
( ~ subset(X6,X4)
| in(X6,sK5(X0,X4)) )
& in(sK5(X0,X4),sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0] :
? [X1] :
( ! [X2,X3] :
( ~ in(X2,X1)
| ~ subset(X3,X2)
| in(X3,X1) )
& ! [X4] :
( ~ in(X4,X1)
| ? [X5] :
( ! [X6] :
( ~ subset(X6,X4)
| in(X6,X5) )
& in(X5,X1) ) )
& ! [X7] :
( are_equipotent(X7,X1)
| ~ subset(X7,X1)
| in(X7,X1) )
& in(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X0] :
? [X1] :
( ! [X7,X6] :
( ~ in(X7,X1)
| ~ subset(X6,X7)
| in(X6,X1) )
& ! [X3] :
( ~ in(X3,X1)
| ? [X4] :
( ! [X5] :
( ~ subset(X5,X3)
| in(X5,X4) )
& in(X4,X1) ) )
& ! [X2] :
( are_equipotent(X2,X1)
| ~ subset(X2,X1)
| in(X2,X1) )
& in(X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X7,X6] :
( in(X6,X1)
| ~ subset(X6,X7)
| ~ in(X7,X1) )
& ! [X3] :
( ~ in(X3,X1)
| ? [X4] :
( ! [X5] :
( ~ subset(X5,X3)
| in(X5,X4) )
& in(X4,X1) ) )
& ! [X2] :
( are_equipotent(X2,X1)
| ~ subset(X2,X1)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X7,X6] :
( ( subset(X6,X7)
& in(X7,X1) )
=> in(X6,X1) )
& ! [X3] :
~ ( ! [X4] :
~ ( in(X4,X1)
& ! [X5] :
( subset(X5,X3)
=> in(X5,X4) ) )
& in(X3,X1) )
& ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
~ ( in(X2,X1)
& ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
( subset(X4,X2)
=> in(X4,X3) ) ) )
& in(X0,X1)
& ! [X3,X2] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_tarski) ).
fof(f183,plain,
( sP0(sK4(sK8))
| ~ in(sK8,sK4(sK8)) ),
inference(duplicate_literal_removal,[],[f179]) ).
fof(f179,plain,
( sP0(sK4(sK8))
| sP0(sK4(sK8))
| ~ in(sK8,sK4(sK8)) ),
inference(resolution,[],[f177,f106]) ).
fof(f106,plain,
! [X0] :
( ~ in(powerset(sK10(sK4(X0))),sK4(X0))
| ~ in(sK8,sK4(X0))
| sP0(sK4(X0)) ),
inference(subsumption_resolution,[],[f105,f70]) ).
fof(f70,plain,
! [X1] :
( ~ in(sK9(X1),X1)
| sP0(X1)
| ~ in(sK8,X1)
| ~ in(powerset(sK10(X1)),X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X1] :
( ( ~ in(sK9(X1),X1)
& ~ are_equipotent(sK9(X1),X1)
& subset(sK9(X1),X1) )
| ( ~ in(powerset(sK10(X1)),X1)
& in(sK10(X1),X1) )
| sP0(X1)
| ~ in(sK8,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f41,f44,f43,f42]) ).
fof(f42,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(X0,X1) )
=> ! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(sK8,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
=> ( ~ in(sK9(X1),X1)
& ~ are_equipotent(sK9(X1),X1)
& subset(sK9(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
! [X1] :
( ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
=> ( ~ in(powerset(sK10(X1)),X1)
& in(sK10(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(X0,X1) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
? [X0] :
! [X1] :
( ? [X3] :
( ~ in(X3,X1)
& ~ are_equipotent(X3,X1)
& subset(X3,X1) )
| ? [X2] :
( ~ in(powerset(X2),X1)
& in(X2,X1) )
| sP0(X1)
| ~ in(X0,X1) ),
inference(definition_folding,[],[f17,f22]) ).
fof(f17,plain,
? [X0] :
! [X1] :
( ? [X3] :
( ~ in(X3,X1)
& ~ are_equipotent(X3,X1)
& subset(X3,X1) )
| ? [X2] :
( ~ in(powerset(X2),X1)
& in(X2,X1) )
| ? [X4,X5] :
( ~ in(X4,X1)
& subset(X4,X5)
& in(X5,X1) )
| ~ in(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(powerset(X2),X1)
& in(X2,X1) )
| ? [X4,X5] :
( ~ in(X4,X1)
& in(X5,X1)
& subset(X4,X5) )
| ? [X3] :
( ~ in(X3,X1)
& ~ are_equipotent(X3,X1)
& subset(X3,X1) )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X4,X5] :
( ( in(X5,X1)
& subset(X4,X5) )
=> in(X4,X1) )
& ! [X3] :
~ ( ~ in(X3,X1)
& ~ are_equipotent(X3,X1)
& subset(X3,X1) )
& in(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& in(X0,X1)
& ! [X2] :
~ ( ~ are_equipotent(X2,X1)
& subset(X2,X1)
& ~ in(X2,X1) )
& ! [X3,X2] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& in(X0,X1)
& ! [X2] :
~ ( ~ are_equipotent(X2,X1)
& subset(X2,X1)
& ~ in(X2,X1) )
& ! [X3,X2] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t136_zfmisc_1) ).
fof(f105,plain,
! [X0] :
( in(sK9(sK4(X0)),sK4(X0))
| ~ in(powerset(sK10(sK4(X0))),sK4(X0))
| ~ in(sK8,sK4(X0))
| sP0(sK4(X0)) ),
inference(subsumption_resolution,[],[f101,f66]) ).
fof(f66,plain,
! [X1] :
( ~ in(sK8,X1)
| subset(sK9(X1),X1)
| ~ in(powerset(sK10(X1)),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f101,plain,
! [X0] :
( sP0(sK4(X0))
| in(sK9(sK4(X0)),sK4(X0))
| ~ in(sK8,sK4(X0))
| ~ subset(sK9(sK4(X0)),sK4(X0))
| ~ in(powerset(sK10(sK4(X0))),sK4(X0)) ),
inference(resolution,[],[f58,f68]) ).
fof(f68,plain,
! [X1] :
( ~ are_equipotent(sK9(X1),X1)
| ~ in(sK8,X1)
| sP0(X1)
| ~ in(powerset(sK10(X1)),X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f58,plain,
! [X0,X7] :
( are_equipotent(X7,sK4(X0))
| in(X7,sK4(X0))
| ~ subset(X7,sK4(X0)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f177,plain,
( in(powerset(sK10(sK4(sK8))),sK4(sK8))
| sP0(sK4(sK8)) ),
inference(subsumption_resolution,[],[f175,f119]) ).
fof(f119,plain,
( in(sK10(sK4(sK8)),sK4(sK8))
| sP0(sK4(sK8)) ),
inference(resolution,[],[f104,f57]) ).
fof(f104,plain,
! [X1] :
( ~ in(sK8,sK4(X1))
| in(sK10(sK4(X1)),sK4(X1))
| sP0(sK4(X1)) ),
inference(subsumption_resolution,[],[f103,f65]) ).
fof(f65,plain,
! [X1] :
( subset(sK9(X1),X1)
| in(sK10(X1),X1)
| ~ in(sK8,X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f103,plain,
! [X1] :
( sP0(sK4(X1))
| ~ in(sK8,sK4(X1))
| ~ subset(sK9(sK4(X1)),sK4(X1))
| in(sK10(sK4(X1)),sK4(X1)) ),
inference(subsumption_resolution,[],[f102,f69]) ).
fof(f69,plain,
! [X1] :
( in(sK10(X1),X1)
| sP0(X1)
| ~ in(sK9(X1),X1)
| ~ in(sK8,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f102,plain,
! [X1] :
( in(sK9(sK4(X1)),sK4(X1))
| in(sK10(sK4(X1)),sK4(X1))
| ~ in(sK8,sK4(X1))
| ~ subset(sK9(sK4(X1)),sK4(X1))
| sP0(sK4(X1)) ),
inference(resolution,[],[f58,f67]) ).
fof(f67,plain,
! [X1] :
( ~ are_equipotent(sK9(X1),X1)
| sP0(X1)
| ~ in(sK8,X1)
| in(sK10(X1),X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f175,plain,
( ~ in(sK10(sK4(sK8)),sK4(sK8))
| sP0(sK4(sK8))
| in(powerset(sK10(sK4(sK8))),sK4(sK8)) ),
inference(resolution,[],[f166,f59]) ).
fof(f59,plain,
! [X0,X4] :
( in(sK5(X0,X4),sK4(X0))
| ~ in(X4,sK4(X0)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f166,plain,
! [X0] :
( ~ in(sK5(sK8,sK10(sK4(sK8))),sK4(X0))
| in(powerset(sK10(sK4(sK8))),sK4(X0))
| sP0(sK4(sK8)) ),
inference(resolution,[],[f164,f61]) ).
fof(f61,plain,
! [X2,X3,X0] :
( ~ subset(X3,X2)
| ~ in(X2,sK4(X0))
| in(X3,sK4(X0)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f164,plain,
( subset(powerset(sK10(sK4(sK8))),sK5(sK8,sK10(sK4(sK8))))
| sP0(sK4(sK8)) ),
inference(duplicate_literal_removal,[],[f162]) ).
fof(f162,plain,
( sP0(sK4(sK8))
| subset(powerset(sK10(sK4(sK8))),sK5(sK8,sK10(sK4(sK8))))
| subset(powerset(sK10(sK4(sK8))),sK5(sK8,sK10(sK4(sK8)))) ),
inference(resolution,[],[f159,f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ in(sK11(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK11(X0,X1),X1)
& in(sK11(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f47,f48]) ).
fof(f48,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK11(X0,X1),X1)
& in(sK11(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X1,X0] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
=> in(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f159,plain,
! [X10] :
( in(sK11(powerset(sK10(sK4(sK8))),X10),sK5(sK8,sK10(sK4(sK8))))
| subset(powerset(sK10(sK4(sK8))),X10)
| sP0(sK4(sK8)) ),
inference(resolution,[],[f88,f120]) ).
fof(f120,plain,
! [X0] :
( ~ subset(X0,sK10(sK4(sK8)))
| in(X0,sK5(sK8,sK10(sK4(sK8))))
| sP0(sK4(sK8)) ),
inference(resolution,[],[f119,f60]) ).
fof(f60,plain,
! [X0,X6,X4] :
( ~ in(X4,sK4(X0))
| in(X6,sK5(X0,X4))
| ~ subset(X6,X4) ),
inference(cnf_transformation,[],[f36]) ).
fof(f88,plain,
! [X2,X3] :
( subset(sK11(powerset(X2),X3),X2)
| subset(powerset(X2),X3) ),
inference(resolution,[],[f72,f75]) ).
fof(f75,plain,
! [X2,X1] :
( ~ in(X2,powerset(X1))
| subset(X2,X1) ),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X2,X0,X1] :
( subset(X2,X1)
| ~ in(X2,X0)
| powerset(X1) != X0 ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( ! [X2] :
( ( subset(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X0)
| ~ subset(X2,X1) ) )
| powerset(X1) != X0 )
& ( powerset(X1) = X0
| ( ( ~ in(sK2(X0,X1),X0)
| ~ subset(sK2(X0,X1),X1) )
& ( in(sK2(X0,X1),X0)
| subset(sK2(X0,X1),X1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f28,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X0)
| ~ subset(X3,X1) )
& ( in(X3,X0)
| subset(X3,X1) ) )
=> ( ( ~ in(sK2(X0,X1),X0)
| ~ subset(sK2(X0,X1),X1) )
& ( in(sK2(X0,X1),X0)
| subset(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1] :
( ( ! [X2] :
( ( subset(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X0)
| ~ subset(X2,X1) ) )
| powerset(X1) != X0 )
& ( powerset(X1) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ~ subset(X3,X1) )
& ( in(X3,X0)
| subset(X3,X1) ) ) ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2] :
( ( subset(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X0)
| ~ subset(X2,X1) ) )
| powerset(X1) != X0 )
& ( powerset(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ~ subset(X2,X1) )
& ( in(X2,X0)
| subset(X2,X1) ) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( subset(X2,X1)
<=> in(X2,X0) )
<=> powerset(X1) = X0 ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f72,plain,
! [X0,X1] :
( in(sK11(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f239,plain,
in(sK6(sK4(sK8)),sK4(sK8)),
inference(resolution,[],[f185,f189]) ).
fof(f189,plain,
in(sK7(sK4(sK8)),sK4(sK8)),
inference(resolution,[],[f184,f62]) ).
fof(f62,plain,
! [X0] :
( ~ sP0(X0)
| in(sK7(X0),X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f185,plain,
! [X0] :
( ~ in(sK7(sK4(sK8)),sK4(X0))
| in(sK6(sK4(sK8)),sK4(X0)) ),
inference(resolution,[],[f184,f97]) ).
fof(f97,plain,
! [X4,X5] :
( ~ sP0(X4)
| ~ in(sK7(X4),sK4(X5))
| in(sK6(X4),sK4(X5)) ),
inference(resolution,[],[f61,f63]) ).
fof(f63,plain,
! [X0] :
( subset(sK6(X0),sK7(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU168+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.16/0.31 % WCLimit : 300
% 0.16/0.31 % DateTime : Tue Aug 30 14:49:40 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.47 % (13853)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.48 TRYING [1]
% 0.16/0.48 % (13869)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 (3000ds/498Mi)
% 0.16/0.48 TRYING [2]
% 0.16/0.48 TRYING [3]
% 0.16/0.48 % (13870)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 (3000ds/467Mi)
% 0.16/0.48 % (13862)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 (3000ds/75Mi)
% 0.16/0.48 TRYING [4]
% 0.16/0.50 % (13854)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.16/0.50 TRYING [5]
% 0.16/0.50 % (13861)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 (3000ds/68Mi)
% 0.16/0.50 % (13847)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 (3000ds/191324Mi)
% 0.16/0.50 % (13856)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 (3000ds/51Mi)
% 0.16/0.51 TRYING [1]
% 0.16/0.51 % (13855)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.52 % (13855)Instruction limit reached!
% 0.16/0.52 % (13855)------------------------------
% 0.16/0.52 % (13855)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.52 % (13855)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.52 % (13855)Termination reason: Unknown
% 0.16/0.52 % (13855)Termination phase: Preprocessing 3
% 0.16/0.52
% 0.16/0.52 % (13855)Memory used [KB]: 895
% 0.16/0.52 % (13855)Time elapsed: 0.003 s
% 0.16/0.52 % (13855)Instructions burned: 2 (million)
% 0.16/0.52 % (13855)------------------------------
% 0.16/0.52 % (13855)------------------------------
% 0.16/0.52 % (13851)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.52 % (13866)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 (3000ds/100Mi)
% 0.16/0.52 % (13850)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.52 % (13854)Instruction limit reached!
% 0.16/0.52 % (13854)------------------------------
% 0.16/0.52 % (13854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.52 % (13849)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 (3000ds/37Mi)
% 0.16/0.52 TRYING [2]
% 0.16/0.52 % (13848)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.16/0.52 % (13875)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.16/0.52 % (13848)Refutation not found, incomplete strategy% (13848)------------------------------
% 0.16/0.52 % (13848)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.52 % (13848)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.52 % (13848)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.52
% 0.16/0.52 % (13848)Memory used [KB]: 5500
% 0.16/0.52 % (13848)Time elapsed: 0.151 s
% 0.16/0.52 % (13848)Instructions burned: 3 (million)
% 0.16/0.52 % (13848)------------------------------
% 0.16/0.52 % (13848)------------------------------
% 0.16/0.52 % (13873)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 (3000ds/68Mi)
% 0.16/0.53 TRYING [3]
% 0.16/0.53 % (13852)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 (3000ds/48Mi)
% 0.16/0.53 TRYING [4]
% 0.16/0.53 % (13871)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.16/0.53 % (13865)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.16/0.54 % (13867)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 1.66/0.54 % (13854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.66/0.54 % (13854)Termination reason: Unknown
% 1.66/0.54 % (13854)Termination phase: Saturation
% 1.66/0.54
% 1.66/0.54 % (13854)Memory used [KB]: 5500
% 1.66/0.54 % (13854)Time elapsed: 0.089 s
% 1.66/0.54 % (13854)Instructions burned: 7 (million)
% 1.66/0.54 % (13854)------------------------------
% 1.66/0.54 % (13854)------------------------------
% 1.66/0.54 % (13858)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 1.66/0.54 % (13863)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 (3000ds/99Mi)
% 1.66/0.54 % (13872)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 1.66/0.54 % (13857)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 1.66/0.54 % (13868)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 1.66/0.54 % (13853)Instruction limit reached!
% 1.66/0.54 % (13853)------------------------------
% 1.66/0.54 % (13853)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.66/0.54 % (13853)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.66/0.54 % (13853)Termination reason: Unknown
% 1.66/0.54 % (13853)Termination phase: Finite model building SAT solving
% 1.66/0.54
% 1.66/0.54 % (13853)Memory used [KB]: 6780
% 1.66/0.54 % (13853)Time elapsed: 0.136 s
% 1.66/0.54 % (13853)Instructions burned: 51 (million)
% 1.66/0.54 % (13853)------------------------------
% 1.66/0.54 % (13853)------------------------------
% 1.66/0.54 % (13859)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 1.66/0.54 % (13864)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 1.66/0.54 % (13874)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 (3000ds/177Mi)
% 1.66/0.55 % (13860)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 1.66/0.55 % (13876)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 (3000ds/355Mi)
% 1.66/0.55 TRYING [5]
% 1.82/0.56 TRYING [1]
% 1.82/0.56 TRYING [2]
% 1.82/0.56 TRYING [3]
% 1.82/0.57 TRYING [4]
% 1.82/0.57 % (13874)First to succeed.
% 1.82/0.58 % (13862)Also succeeded, but the first one will report.
% 1.82/0.59 % (13874)Refutation found. Thanks to Tanya!
% 1.82/0.59 % SZS status Theorem for theBenchmark
% 1.82/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.82/0.59 % (13874)------------------------------
% 1.82/0.59 % (13874)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.82/0.59 % (13874)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.82/0.59 % (13874)Termination reason: Refutation
% 1.82/0.59
% 1.82/0.59 % (13874)Memory used [KB]: 1151
% 1.82/0.59 % (13874)Time elapsed: 0.207 s
% 1.82/0.59 % (13874)Instructions burned: 12 (million)
% 1.82/0.59 % (13874)------------------------------
% 1.82/0.59 % (13874)------------------------------
% 1.82/0.59 % (13846)Success in time 0.261 s
%------------------------------------------------------------------------------