TSTP Solution File: SEU117+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU117+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 : n004.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:26:43 EDT 2022
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 50 ( 10 unt; 0 def)
% Number of atoms : 178 ( 12 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 202 ( 74 ~; 73 |; 36 &)
% ( 11 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 54 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f271,plain,
$false,
inference(avatar_sat_refutation,[],[f205,f243,f249,f252,f270]) ).
fof(f270,plain,
~ spl13_5,
inference(avatar_contradiction_clause,[],[f269]) ).
fof(f269,plain,
( $false
| ~ spl13_5 ),
inference(resolution,[],[f248,f183]) ).
fof(f183,plain,
~ subset(sK8,sK9),
inference(resolution,[],[f150,f139]) ).
fof(f139,plain,
~ element(sK8,powerset(sK9)),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( element(sK8,finite_subsets(sK9))
& ~ element(sK8,powerset(sK9)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f49,f89]) ).
fof(f89,plain,
( ? [X0,X1] :
( element(X0,finite_subsets(X1))
& ~ element(X0,powerset(X1)) )
=> ( element(sK8,finite_subsets(sK9))
& ~ element(sK8,powerset(sK9)) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
? [X0,X1] :
( element(X0,finite_subsets(X1))
& ~ element(X0,powerset(X1)) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
~ ! [X0,X1] :
( element(X0,finite_subsets(X1))
=> element(X0,powerset(X1)) ),
inference(rectify,[],[f32]) ).
fof(f32,negated_conjecture,
~ ! [X1,X0] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
! [X1,X0] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_finsub_1) ).
fof(f150,plain,
! [X0,X1] :
( element(X1,powerset(X0))
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1] :
( ( element(X1,powerset(X0))
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ~ element(X1,powerset(X0)) ) ),
inference(rectify,[],[f97]) ).
fof(f97,plain,
! [X1,X0] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X1,X0] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f248,plain,
( subset(sK8,sK9)
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f246,plain,
( spl13_5
<=> subset(sK8,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_5])]) ).
fof(f252,plain,
~ spl13_1,
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f250,plain,
( $false
| ~ spl13_1 ),
inference(resolution,[],[f200,f121]) ).
fof(f121,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( preboolean(finite_subsets(X0))
& ~ empty(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& cup_closed(finite_subsets(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f200,plain,
( empty(finite_subsets(sK9))
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f198,plain,
( spl13_1
<=> empty(finite_subsets(sK9)) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
fof(f249,plain,
( spl13_5
| ~ spl13_4
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f244,f202,f229,f246]) ).
fof(f229,plain,
( spl13_4
<=> preboolean(finite_subsets(sK9)) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
fof(f202,plain,
( spl13_2
<=> in(sK8,finite_subsets(sK9)) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
fof(f244,plain,
( ~ preboolean(finite_subsets(sK9))
| subset(sK8,sK9)
| ~ spl13_2 ),
inference(resolution,[],[f161,f204]) ).
fof(f204,plain,
( in(sK8,finite_subsets(sK9))
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f161,plain,
! [X2,X0] :
( ~ in(X2,finite_subsets(X0))
| subset(X2,X0)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f146]) ).
fof(f146,plain,
! [X2,X0,X1] :
( subset(X2,X0)
| ~ in(X2,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) )
& ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) ) )
| finite_subsets(X0) != X1 )
& ( finite_subsets(X0) = X1
| ( ( ~ in(sK10(X0,X1),X1)
| ~ subset(sK10(X0,X1),X0)
| ~ finite(sK10(X0,X1)) )
& ( in(sK10(X0,X1),X1)
| ( subset(sK10(X0,X1),X0)
& finite(sK10(X0,X1)) ) ) ) ) )
| ~ preboolean(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f93,f94]) ).
fof(f94,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( in(X3,X1)
| ( subset(X3,X0)
& finite(X3) ) ) )
=> ( ( ~ in(sK10(X0,X1),X1)
| ~ subset(sK10(X0,X1),X0)
| ~ finite(sK10(X0,X1)) )
& ( in(sK10(X0,X1),X1)
| ( subset(sK10(X0,X1),X0)
& finite(sK10(X0,X1)) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) )
& ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) ) )
| finite_subsets(X0) != X1 )
& ( finite_subsets(X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( in(X3,X1)
| ( subset(X3,X0)
& finite(X3) ) ) ) ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f92]) ).
fof(f92,plain,
! [X1,X0] :
( ( ( ! [X2] :
( ( ( subset(X2,X1)
& finite(X2) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) ) )
| finite_subsets(X1) != X0 )
& ( finite_subsets(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) )
& ( in(X2,X0)
| ( subset(X2,X1)
& finite(X2) ) ) ) ) )
| ~ preboolean(X0) ),
inference(flattening,[],[f91]) ).
fof(f91,plain,
! [X1,X0] :
( ( ( ! [X2] :
( ( ( subset(X2,X1)
& finite(X2) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) ) )
| finite_subsets(X1) != X0 )
& ( finite_subsets(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) )
& ( in(X2,X0)
| ( subset(X2,X1)
& finite(X2) ) ) ) ) )
| ~ preboolean(X0) ),
inference(nnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X1,X0] :
( ( ! [X2] :
( ( subset(X2,X1)
& finite(X2) )
<=> in(X2,X0) )
<=> finite_subsets(X1) = X0 )
| ~ preboolean(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( preboolean(X0)
=> ( ! [X2] :
( ( subset(X2,X1)
& finite(X2) )
<=> in(X2,X0) )
<=> finite_subsets(X1) = X0 ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X1,X0] :
( preboolean(X1)
=> ( ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) )
<=> finite_subsets(X0) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f243,plain,
spl13_4,
inference(avatar_contradiction_clause,[],[f240]) ).
fof(f240,plain,
( $false
| spl13_4 ),
inference(resolution,[],[f231,f151]) ).
fof(f151,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f231,plain,
( ~ preboolean(finite_subsets(sK9))
| spl13_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f205,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f195,f202,f198]) ).
fof(f195,plain,
( in(sK8,finite_subsets(sK9))
| empty(finite_subsets(sK9)) ),
inference(resolution,[],[f106,f140]) ).
fof(f140,plain,
element(sK8,finite_subsets(sK9)),
inference(cnf_transformation,[],[f90]) ).
fof(f106,plain,
! [X0,X1] :
( ~ element(X0,X1)
| empty(X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( empty(X1)
| ~ element(X0,X1)
| in(X0,X1) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 14:36:04 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.48 % (11515)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.17/0.48 % (11515)Instruction limit reached!
% 0.17/0.48 % (11515)------------------------------
% 0.17/0.48 % (11515)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (11515)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (11515)Termination reason: Unknown
% 0.17/0.49 % (11515)Termination phase: Saturation
% 0.17/0.49
% 0.17/0.49 % (11515)Memory used [KB]: 6012
% 0.17/0.49 % (11515)Time elapsed: 0.004 s
% 0.17/0.49 % (11515)Instructions burned: 3 (million)
% 0.17/0.49 % (11515)------------------------------
% 0.17/0.49 % (11515)------------------------------
% 0.17/0.49 % (11502)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.17/0.49 % (11507)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.17/0.50 % (11505)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.17/0.50 % (11507)Refutation not found, incomplete strategy% (11507)------------------------------
% 0.17/0.50 % (11507)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (11507)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (11507)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.50
% 0.17/0.50 % (11507)Memory used [KB]: 6012
% 0.17/0.50 % (11507)Time elapsed: 0.109 s
% 0.17/0.50 % (11507)Instructions burned: 2 (million)
% 0.17/0.50 % (11507)------------------------------
% 0.17/0.50 % (11507)------------------------------
% 0.17/0.50 % (11505)Refutation not found, incomplete strategy% (11505)------------------------------
% 0.17/0.50 % (11505)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (11505)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (11505)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.50
% 0.17/0.50 % (11505)Memory used [KB]: 6012
% 0.17/0.50 % (11505)Time elapsed: 0.109 s
% 0.17/0.50 % (11505)Instructions burned: 2 (million)
% 0.17/0.50 % (11505)------------------------------
% 0.17/0.50 % (11505)------------------------------
% 0.17/0.50 % (11523)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.17/0.50 % (11521)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.17/0.51 % (11513)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.17/0.51 % (11523)First to succeed.
% 0.17/0.52 % (11514)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.52 % (11503)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.17/0.52 % (11501)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.17/0.52 % (11523)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (11523)------------------------------
% 0.17/0.52 % (11523)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.52 % (11523)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.52 % (11523)Termination reason: Refutation
% 0.17/0.52
% 0.17/0.52 % (11523)Memory used [KB]: 6012
% 0.17/0.52 % (11523)Time elapsed: 0.124 s
% 0.17/0.52 % (11523)Instructions burned: 5 (million)
% 0.17/0.52 % (11523)------------------------------
% 0.17/0.52 % (11523)------------------------------
% 0.17/0.52 % (11500)Success in time 0.185 s
%------------------------------------------------------------------------------