TSTP Solution File: SET947+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET947+1 : 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_uns --cores 0 -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 : Wed Aug 31 18:22:49 EDT 2022
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 10 unt; 0 def)
% Number of atoms : 114 ( 11 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 126 ( 49 ~; 45 |; 19 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 60 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f114,plain,
$false,
inference(subsumption_resolution,[],[f113,f50]) ).
fof(f50,plain,
~ subset(sK3,sF6),
inference(definition_folding,[],[f44,f49,f48]) ).
fof(f48,plain,
union(sK3) = sF5,
introduced(function_definition,[]) ).
fof(f49,plain,
powerset(sF5) = sF6,
introduced(function_definition,[]) ).
fof(f44,plain,
~ subset(sK3,powerset(union(sK3))),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
~ subset(sK3,powerset(union(sK3))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f29]) ).
fof(f29,plain,
( ? [X0] : ~ subset(X0,powerset(union(X0)))
=> ~ subset(sK3,powerset(union(sK3))) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0] : ~ subset(X0,powerset(union(X0))),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0] : subset(X0,powerset(union(X0))),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0] : subset(X0,powerset(union(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(f113,plain,
subset(sK3,sF6),
inference(duplicate_literal_removal,[],[f112]) ).
fof(f112,plain,
( subset(sK3,sF6)
| subset(sK3,sF6) ),
inference(resolution,[],[f68,f35]) ).
fof(f35,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( in(sK1(X0,X1),X0)
& ~ in(sK1(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) )
=> ( in(sK1(X0,X1),X0)
& ~ in(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) ) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
=> in(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f68,plain,
! [X2] :
( ~ in(sK1(X2,sF6),sK3)
| subset(X2,sF6) ),
inference(resolution,[],[f34,f54]) ).
fof(f54,plain,
! [X0] :
( in(X0,sF6)
| ~ in(X0,sK3) ),
inference(resolution,[],[f53,f51]) ).
fof(f51,plain,
! [X0] :
( subset(X0,sF5)
| ~ in(X0,sK3) ),
inference(superposition,[],[f38,f48]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X1,union(X0))
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X1,union(X0))
| ~ in(X1,X0) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f53,plain,
! [X0] :
( ~ subset(X0,sF5)
| in(X0,sF6) ),
inference(superposition,[],[f46,f49]) ).
fof(f46,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(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,[sK2])],[f25,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,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,[],[f24]) ).
fof(f24,plain,
! [X1,X0] :
( ( powerset(X1) = X0
| ? [X2] :
( ( ~ subset(X2,X1)
| ~ in(X2,X0) )
& ( subset(X2,X1)
| in(X2,X0) ) ) )
& ( ! [X2] :
( ( in(X2,X0)
| ~ subset(X2,X1) )
& ( subset(X2,X1)
| ~ in(X2,X0) ) )
| powerset(X1) != X0 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( powerset(X1) = X0
<=> ! [X2] :
( in(X2,X0)
<=> subset(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 30 14:41:00 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.44 % (28758)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.16/0.46 % (28773)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.47 % (28758)First to succeed.
% 0.16/0.47 % (28758)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (28758)------------------------------
% 0.16/0.47 % (28758)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.47 % (28758)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.47 % (28758)Termination reason: Refutation
% 0.16/0.47
% 0.16/0.47 % (28758)Memory used [KB]: 6012
% 0.16/0.47 % (28758)Time elapsed: 0.105 s
% 0.16/0.47 % (28758)Instructions burned: 4 (million)
% 0.16/0.47 % (28758)------------------------------
% 0.16/0.47 % (28758)------------------------------
% 0.16/0.47 % (28757)Success in time 0.157 s
%------------------------------------------------------------------------------