TSTP Solution File: SEU168+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU168+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n029.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 May 1 03:50:24 EDT 2024
% Result : Theorem 0.66s 0.84s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 13
% Syntax : Number of formulae : 86 ( 11 unt; 0 def)
% Number of atoms : 383 ( 9 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 488 ( 191 ~; 159 |; 115 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 212 ( 165 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f391,plain,
$false,
inference(subsumption_resolution,[],[f390,f52]) ).
fof(f52,plain,
! [X0] : in(X0,sK7(X0)),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0] :
( ! [X2] :
( in(X2,sK7(X0))
| are_equipotent(X2,sK7(X0))
| ~ subset(X2,sK7(X0)) )
& ! [X3] :
( ( ! [X5] :
( in(X5,sK8(X0,X3))
| ~ subset(X5,X3) )
& in(sK8(X0,X3),sK7(X0)) )
| ~ in(X3,sK7(X0)) )
& ! [X6,X7] :
( in(X7,sK7(X0))
| ~ subset(X7,X6)
| ~ in(X6,sK7(X0)) )
& in(X0,sK7(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f15,f33,f32]) ).
fof(f32,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) )
=> ( ! [X2] :
( in(X2,sK7(X0))
| are_equipotent(X2,sK7(X0))
| ~ subset(X2,sK7(X0)) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,sK7(X0)) )
| ~ in(X3,sK7(X0)) )
& ! [X7,X6] :
( in(X7,sK7(X0))
| ~ subset(X7,X6)
| ~ in(X6,sK7(X0)) )
& in(X0,sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,sK7(X0)) )
=> ( ! [X5] :
( in(X5,sK8(X0,X3))
| ~ subset(X5,X3) )
& in(sK8(X0,X3),sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X3] :
~ ( ! [X4] :
~ ( ! [X5] :
( subset(X5,X3)
=> in(X5,X4) )
& in(X4,X1) )
& in(X3,X1) )
& ! [X6,X7] :
( ( subset(X7,X6)
& in(X6,X1) )
=> in(X7,X1) )
& in(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
~ ( ! [X3] :
~ ( ! [X4] :
( subset(X4,X2)
=> in(X4,X3) )
& in(X3,X1) )
& in(X2,X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.CZ2M7EVnsY/Vampire---4.8_1358',t9_tarski) ).
fof(f390,plain,
~ in(sK3,sK7(sK3)),
inference(subsumption_resolution,[],[f385,f362]) ).
fof(f362,plain,
in(powerset(sK5(sK7(sK3))),sK7(sK3)),
inference(subsumption_resolution,[],[f356,f131]) ).
fof(f131,plain,
in(sK5(sK7(sK3)),sK7(sK3)),
inference(resolution,[],[f130,f52]) ).
fof(f130,plain,
! [X0] :
( ~ in(sK3,sK7(X0))
| in(sK5(sK7(X0)),sK7(X0)) ),
inference(subsumption_resolution,[],[f129,f121]) ).
fof(f121,plain,
! [X0] :
( ~ in(sK3,sK7(X0))
| subset(sK4(sK7(X0)),sK7(X0))
| in(sK5(sK7(X0)),sK7(X0)) ),
inference(resolution,[],[f115,f42]) ).
fof(f42,plain,
! [X1] :
( sP0(X1)
| in(sK5(X1),X1)
| subset(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1] :
( ( ~ in(sK4(X1),X1)
& ~ are_equipotent(sK4(X1),X1)
& subset(sK4(X1),X1) )
| ( ~ in(powerset(sK5(X1)),X1)
& in(sK5(X1),X1) )
| sP0(X1)
| ~ in(sK3,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f19,f26,f25,f24]) ).
fof(f24,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(sK3,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
=> ( ~ in(sK4(X1),X1)
& ~ are_equipotent(sK4(X1),X1)
& subset(sK4(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X1] :
( ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
=> ( ~ in(powerset(sK5(X1)),X1)
& in(sK5(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,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(definition_folding,[],[f13,f18]) ).
fof(f18,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f13,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ in(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
~ ! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X3] :
( in(X3,X1)
=> in(powerset(X3),X1) )
& ! [X4,X5] :
( ( subset(X5,X4)
& in(X4,X1) )
=> in(X5,X1) )
& in(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.CZ2M7EVnsY/Vampire---4.8_1358',t136_zfmisc_1) ).
fof(f115,plain,
! [X0] : ~ sP0(sK7(X0)),
inference(subsumption_resolution,[],[f114,f41]) ).
fof(f41,plain,
! [X0] :
( ~ in(sK2(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ( ~ in(sK2(X0),X0)
& subset(sK2(X0),sK1(X0))
& in(sK1(X0),X0) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f21,f22]) ).
fof(f22,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X2,X0)
& subset(X2,X1)
& in(X1,X0) )
=> ( ~ in(sK2(X0),X0)
& subset(sK2(X0),sK1(X0))
& in(sK1(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X2,X0)
& subset(X2,X1)
& in(X1,X0) )
| ~ sP0(X0) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f18]) ).
fof(f114,plain,
! [X0] :
( in(sK2(sK7(X0)),sK7(X0))
| ~ sP0(sK7(X0)) ),
inference(duplicate_literal_removal,[],[f112]) ).
fof(f112,plain,
! [X0] :
( in(sK2(sK7(X0)),sK7(X0))
| ~ sP0(sK7(X0))
| ~ sP0(sK7(X0)) ),
inference(resolution,[],[f80,f39]) ).
fof(f39,plain,
! [X0] :
( in(sK1(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f80,plain,
! [X0,X1] :
( ~ in(sK1(X0),sK7(X1))
| in(sK2(X0),sK7(X1))
| ~ sP0(X0) ),
inference(resolution,[],[f53,f40]) ).
fof(f40,plain,
! [X0] :
( subset(sK2(X0),sK1(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f53,plain,
! [X0,X6,X7] :
( ~ subset(X7,X6)
| in(X7,sK7(X0))
| ~ in(X6,sK7(X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f129,plain,
! [X0] :
( in(sK5(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0))
| ~ subset(sK4(sK7(X0)),sK7(X0)) ),
inference(subsumption_resolution,[],[f128,f119]) ).
fof(f119,plain,
! [X0] :
( ~ in(sK4(sK7(X0)),sK7(X0))
| in(sK5(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0)) ),
inference(resolution,[],[f115,f46]) ).
fof(f46,plain,
! [X1] :
( sP0(X1)
| in(sK5(X1),X1)
| ~ in(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f128,plain,
! [X0] :
( in(sK5(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0))
| in(sK4(sK7(X0)),sK7(X0))
| ~ subset(sK4(sK7(X0)),sK7(X0)) ),
inference(resolution,[],[f120,f56]) ).
fof(f56,plain,
! [X2,X0] :
( are_equipotent(X2,sK7(X0))
| in(X2,sK7(X0))
| ~ subset(X2,sK7(X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f120,plain,
! [X0] :
( ~ are_equipotent(sK4(sK7(X0)),sK7(X0))
| in(sK5(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0)) ),
inference(resolution,[],[f115,f44]) ).
fof(f44,plain,
! [X1] :
( sP0(X1)
| in(sK5(X1),X1)
| ~ are_equipotent(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f356,plain,
( in(powerset(sK5(sK7(sK3))),sK7(sK3))
| ~ in(sK5(sK7(sK3)),sK7(sK3)) ),
inference(resolution,[],[f348,f105]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ in(X0,powerset(sK8(X1,X2)))
| in(X0,sK7(X1))
| ~ in(X2,sK7(X1)) ),
inference(resolution,[],[f79,f54]) ).
fof(f54,plain,
! [X3,X0] :
( in(sK8(X0,X3),sK7(X0))
| ~ in(X3,sK7(X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f79,plain,
! [X2,X0,X1] :
( ~ in(X2,sK7(X1))
| in(X0,sK7(X1))
| ~ in(X0,powerset(X2)) ),
inference(resolution,[],[f53,f63]) ).
fof(f63,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f48]) ).
fof(f48,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK6(X0,X1),X0)
| ~ in(sK6(X0,X1),X1) )
& ( subset(sK6(X0,X1),X0)
| in(sK6(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK6(X0,X1),X0)
| ~ in(sK6(X0,X1),X1) )
& ( subset(sK6(X0,X1),X0)
| in(sK6(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.CZ2M7EVnsY/Vampire---4.8_1358',d1_zfmisc_1) ).
fof(f348,plain,
in(powerset(sK5(sK7(sK3))),powerset(sK8(sK3,sK5(sK7(sK3))))),
inference(resolution,[],[f338,f62]) ).
fof(f62,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f338,plain,
subset(powerset(sK5(sK7(sK3))),sK8(sK3,sK5(sK7(sK3)))),
inference(duplicate_literal_removal,[],[f336]) ).
fof(f336,plain,
( subset(powerset(sK5(sK7(sK3))),sK8(sK3,sK5(sK7(sK3))))
| subset(powerset(sK5(sK7(sK3))),sK8(sK3,sK5(sK7(sK3)))) ),
inference(resolution,[],[f211,f59]) ).
fof(f59,plain,
! [X0,X1] :
( ~ in(sK9(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK9(X0,X1),X1)
& in(sK9(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK9(X0,X1),X1)
& in(sK9(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f36,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,[],[f35]) ).
fof(f35,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,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.CZ2M7EVnsY/Vampire---4.8_1358',d3_tarski) ).
fof(f211,plain,
! [X0] :
( in(sK9(powerset(sK5(sK7(sK3))),X0),sK8(sK3,sK5(sK7(sK3))))
| subset(powerset(sK5(sK7(sK3))),X0) ),
inference(resolution,[],[f134,f58]) ).
fof(f58,plain,
! [X0,X1] :
( in(sK9(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f134,plain,
! [X0] :
( ~ in(X0,powerset(sK5(sK7(sK3))))
| in(X0,sK8(sK3,sK5(sK7(sK3)))) ),
inference(resolution,[],[f131,f86]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ in(X2,sK7(X1))
| in(X0,sK8(X1,X2))
| ~ in(X0,powerset(X2)) ),
inference(resolution,[],[f55,f63]) ).
fof(f55,plain,
! [X3,X0,X5] :
( ~ subset(X5,X3)
| in(X5,sK8(X0,X3))
| ~ in(X3,sK7(X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f385,plain,
( ~ in(powerset(sK5(sK7(sK3))),sK7(sK3))
| ~ in(sK3,sK7(sK3)) ),
inference(resolution,[],[f380,f116]) ).
fof(f116,plain,
! [X0] :
( ~ in(sK4(sK7(X0)),sK7(X0))
| ~ in(powerset(sK5(sK7(X0))),sK7(X0))
| ~ in(sK3,sK7(X0)) ),
inference(resolution,[],[f115,f47]) ).
fof(f47,plain,
! [X1] :
( sP0(X1)
| ~ in(powerset(sK5(X1)),X1)
| ~ in(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f380,plain,
in(sK4(sK7(sK3)),sK7(sK3)),
inference(subsumption_resolution,[],[f379,f368]) ).
fof(f368,plain,
subset(sK4(sK7(sK3)),sK7(sK3)),
inference(subsumption_resolution,[],[f363,f52]) ).
fof(f363,plain,
( subset(sK4(sK7(sK3)),sK7(sK3))
| ~ in(sK3,sK7(sK3)) ),
inference(resolution,[],[f362,f118]) ).
fof(f118,plain,
! [X0] :
( ~ in(powerset(sK5(sK7(X0))),sK7(X0))
| subset(sK4(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0)) ),
inference(resolution,[],[f115,f43]) ).
fof(f43,plain,
! [X1] :
( sP0(X1)
| ~ in(powerset(sK5(X1)),X1)
| subset(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f379,plain,
( in(sK4(sK7(sK3)),sK7(sK3))
| ~ subset(sK4(sK7(sK3)),sK7(sK3)) ),
inference(resolution,[],[f369,f56]) ).
fof(f369,plain,
~ are_equipotent(sK4(sK7(sK3)),sK7(sK3)),
inference(subsumption_resolution,[],[f364,f52]) ).
fof(f364,plain,
( ~ are_equipotent(sK4(sK7(sK3)),sK7(sK3))
| ~ in(sK3,sK7(sK3)) ),
inference(resolution,[],[f362,f117]) ).
fof(f117,plain,
! [X0] :
( ~ in(powerset(sK5(sK7(X0))),sK7(X0))
| ~ are_equipotent(sK4(sK7(X0)),sK7(X0))
| ~ in(sK3,sK7(X0)) ),
inference(resolution,[],[f115,f45]) ).
fof(f45,plain,
! [X1] :
( sP0(X1)
| ~ in(powerset(sK5(X1)),X1)
| ~ are_equipotent(sK4(X1),X1)
| ~ in(sK3,X1) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU168+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 30 16:35:35 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.CZ2M7EVnsY/Vampire---4.8_1358
% 0.65/0.82 % (1474)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.65/0.82 % (1473)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.82 % (1475)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.65/0.82 % (1469)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.82 % (1471)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.65/0.82 % (1476)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.65/0.82 % (1470)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.65/0.82 % (1472)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.65/0.84 % (1471)First to succeed.
% 0.65/0.84 % (1473)Instruction limit reached!
% 0.65/0.84 % (1473)------------------------------
% 0.65/0.84 % (1473)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.84 % (1473)Termination reason: Unknown
% 0.65/0.84 % (1473)Termination phase: Saturation
% 0.65/0.84
% 0.65/0.84 % (1473)Memory used [KB]: 1262
% 0.65/0.84 % (1473)Time elapsed: 0.019 s
% 0.66/0.84 % (1473)Instructions burned: 34 (million)
% 0.66/0.84 % (1473)------------------------------
% 0.66/0.84 % (1473)------------------------------
% 0.66/0.84 % (1471)Refutation found. Thanks to Tanya!
% 0.66/0.84 % SZS status Theorem for Vampire---4
% 0.66/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.84 % (1471)------------------------------
% 0.66/0.84 % (1471)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.84 % (1471)Termination reason: Refutation
% 0.66/0.84
% 0.66/0.84 % (1471)Memory used [KB]: 1217
% 0.66/0.84 % (1471)Time elapsed: 0.018 s
% 0.66/0.84 % (1471)Instructions burned: 28 (million)
% 0.66/0.84 % (1471)------------------------------
% 0.66/0.84 % (1471)------------------------------
% 0.66/0.84 % (1467)Success in time 0.488 s
% 0.66/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------