TSTP Solution File: SEU307+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU307+1 : 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_uns --cores 0 -t %d %s
% Computer : n015.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:28:35 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 74 ( 9 unt; 0 def)
% Number of atoms : 171 ( 26 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 162 ( 65 ~; 61 |; 14 &)
% ( 9 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 70 ( 64 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f768,plain,
$false,
inference(avatar_sat_refutation,[],[f292,f475,f559,f700,f705,f723,f746,f767]) ).
fof(f767,plain,
( ~ spl7_2
| spl7_30 ),
inference(avatar_split_clause,[],[f763,f697,f282]) ).
fof(f282,plain,
( spl7_2
<=> one_sorted_str(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f697,plain,
( spl7_30
<=> element(cast_as_carrier_subset(sK2),powerset(the_carrier(sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_30])]) ).
fof(f763,plain,
( ~ one_sorted_str(sK2)
| spl7_30 ),
inference(resolution,[],[f699,f208]) ).
fof(f208,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( one_sorted_str(X0)
=> element(cast_as_carrier_subset(X0),powerset(the_carrier(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_pre_topc) ).
fof(f699,plain,
( ~ element(cast_as_carrier_subset(sK2),powerset(the_carrier(sK2)))
| spl7_30 ),
inference(avatar_component_clause,[],[f697]) ).
fof(f746,plain,
( spl7_16
| spl7_17
| ~ spl7_29 ),
inference(avatar_split_clause,[],[f743,f693,f466,f462]) ).
fof(f462,plain,
( spl7_16
<=> empty(powerset(the_carrier(sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_16])]) ).
fof(f466,plain,
( spl7_17
<=> in(sK3,powerset(the_carrier(sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_17])]) ).
fof(f693,plain,
( spl7_29
<=> element(sK3,powerset(the_carrier(sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_29])]) ).
fof(f743,plain,
( in(sK3,powerset(the_carrier(sK2)))
| empty(powerset(the_carrier(sK2)))
| ~ spl7_29 ),
inference(resolution,[],[f694,f232]) ).
fof(f232,plain,
! [X0,X1] :
( ~ element(X1,X0)
| in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( in(X1,X0)
| ~ element(X1,X0)
| empty(X0) ),
inference(rectify,[],[f107]) ).
fof(f107,plain,
! [X1,X0] :
( in(X0,X1)
| ~ element(X0,X1)
| empty(X1) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
! [X1,X0] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X1,X0] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f694,plain,
( element(sK3,powerset(the_carrier(sK2)))
| ~ spl7_29 ),
inference(avatar_component_clause,[],[f693]) ).
fof(f723,plain,
spl7_29,
inference(avatar_contradiction_clause,[],[f719]) ).
fof(f719,plain,
( $false
| spl7_29 ),
inference(resolution,[],[f695,f196]) ).
fof(f196,plain,
element(sK3,powerset(the_carrier(sK2))),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
( one_sorted_str(sK2)
& element(sK3,powerset(the_carrier(sK2)))
& sK3 != subset_intersection2(the_carrier(sK2),sK3,cast_as_carrier_subset(sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f108,f148,f147]) ).
fof(f147,plain,
( ? [X0] :
( one_sorted_str(X0)
& ? [X1] :
( element(X1,powerset(the_carrier(X0)))
& subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1 ) )
=> ( one_sorted_str(sK2)
& ? [X1] :
( element(X1,powerset(the_carrier(sK2)))
& subset_intersection2(the_carrier(sK2),X1,cast_as_carrier_subset(sK2)) != X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X1] :
( element(X1,powerset(the_carrier(sK2)))
& subset_intersection2(the_carrier(sK2),X1,cast_as_carrier_subset(sK2)) != X1 )
=> ( element(sK3,powerset(the_carrier(sK2)))
& sK3 != subset_intersection2(the_carrier(sK2),sK3,cast_as_carrier_subset(sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
? [X0] :
( one_sorted_str(X0)
& ? [X1] :
( element(X1,powerset(the_carrier(X0)))
& subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1 ) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
inference(negated_conjecture,[],[f58]) ).
fof(f58,conjecture,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc) ).
fof(f695,plain,
( ~ element(sK3,powerset(the_carrier(sK2)))
| spl7_29 ),
inference(avatar_component_clause,[],[f693]) ).
fof(f705,plain,
( ~ spl7_4
| spl7_28 ),
inference(avatar_split_clause,[],[f704,f688,f307]) ).
fof(f307,plain,
( spl7_4
<=> subset(sK3,cast_as_carrier_subset(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f688,plain,
( spl7_28
<=> sK3 = set_intersection2(sK3,cast_as_carrier_subset(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_28])]) ).
fof(f704,plain,
( ~ subset(sK3,cast_as_carrier_subset(sK2))
| spl7_28 ),
inference(trivial_inequality_removal,[],[f703]) ).
fof(f703,plain,
( ~ subset(sK3,cast_as_carrier_subset(sK2))
| sK3 != sK3
| spl7_28 ),
inference(superposition,[],[f690,f183]) ).
fof(f183,plain,
! [X0,X1] :
( set_intersection2(X1,X0) = X1
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0,X1] :
( set_intersection2(X1,X0) = X1
| ~ subset(X1,X0) ),
inference(rectify,[],[f134]) ).
fof(f134,plain,
! [X1,X0] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,axiom,
! [X1,X0] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f690,plain,
( sK3 != set_intersection2(sK3,cast_as_carrier_subset(sK2))
| spl7_28 ),
inference(avatar_component_clause,[],[f688]) ).
fof(f700,plain,
( ~ spl7_29
| ~ spl7_28
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f676,f697,f688,f693]) ).
fof(f676,plain,
( ~ element(cast_as_carrier_subset(sK2),powerset(the_carrier(sK2)))
| sK3 != set_intersection2(sK3,cast_as_carrier_subset(sK2))
| ~ element(sK3,powerset(the_carrier(sK2))) ),
inference(superposition,[],[f195,f177]) ).
fof(f177,plain,
! [X2,X0,X1] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0,X1,X2] :
( ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0)) ),
inference(rectify,[],[f121]) ).
fof(f121,plain,
! [X1,X0,X2] :
( ~ element(X0,powerset(X1))
| set_intersection2(X0,X2) = subset_intersection2(X1,X0,X2)
| ~ element(X2,powerset(X1)) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X2,X1,X0] :
( set_intersection2(X0,X2) = subset_intersection2(X1,X0,X2)
| ~ element(X0,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
! [X2,X1,X0] :
( ( element(X0,powerset(X1))
& element(X2,powerset(X1)) )
=> set_intersection2(X0,X2) = subset_intersection2(X1,X0,X2) ),
inference(rectify,[],[f47]) ).
fof(f47,axiom,
! [X1,X0,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(f195,plain,
sK3 != subset_intersection2(the_carrier(sK2),sK3,cast_as_carrier_subset(sK2)),
inference(cnf_transformation,[],[f149]) ).
fof(f559,plain,
( spl7_4
| ~ spl7_2
| ~ spl7_17 ),
inference(avatar_split_clause,[],[f558,f466,f282,f307]) ).
fof(f558,plain,
( ~ one_sorted_str(sK2)
| subset(sK3,cast_as_carrier_subset(sK2))
| ~ spl7_17 ),
inference(superposition,[],[f542,f189]) ).
fof(f189,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f542,plain,
( subset(sK3,the_carrier(sK2))
| ~ spl7_17 ),
inference(resolution,[],[f479,f265]) ).
fof(f265,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ~ element(X0,powerset(X1)) )
& ( element(X0,powerset(X1))
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f168]) ).
fof(f168,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ~ element(X1,powerset(X0)) )
& ( element(X1,powerset(X0))
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X1,X0] :
( subset(X1,X0)
<=> element(X1,powerset(X0)) ),
inference(rectify,[],[f56]) ).
fof(f56,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f479,plain,
( element(sK3,powerset(the_carrier(sK2)))
| ~ spl7_17 ),
inference(resolution,[],[f468,f201]) ).
fof(f201,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(f468,plain,
( in(sK3,powerset(the_carrier(sK2)))
| ~ spl7_17 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f475,plain,
~ spl7_16,
inference(avatar_contradiction_clause,[],[f470]) ).
fof(f470,plain,
( $false
| ~ spl7_16 ),
inference(resolution,[],[f464,f229]) ).
fof(f229,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f464,plain,
( empty(powerset(the_carrier(sK2)))
| ~ spl7_16 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f292,plain,
spl7_2,
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| spl7_2 ),
inference(resolution,[],[f284,f197]) ).
fof(f197,plain,
one_sorted_str(sK2),
inference(cnf_transformation,[],[f149]) ).
fof(f284,plain,
( ~ one_sorted_str(sK2)
| spl7_2 ),
inference(avatar_component_clause,[],[f282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 15:20:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 % (32462)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.21/0.50 % (32470)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.21/0.50 % (32462)Instruction limit reached!
% 0.21/0.50 % (32462)------------------------------
% 0.21/0.50 % (32462)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (32462)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (32462)Termination reason: Unknown
% 0.21/0.50 % (32462)Termination phase: Saturation
% 0.21/0.50
% 0.21/0.50 % (32462)Memory used [KB]: 6012
% 0.21/0.50 % (32462)Time elapsed: 0.005 s
% 0.21/0.50 % (32462)Instructions burned: 3 (million)
% 0.21/0.50 % (32462)------------------------------
% 0.21/0.50 % (32462)------------------------------
% 0.21/0.52 % (32470)First to succeed.
% 0.21/0.52 % (32455)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.52 % (32470)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (32470)------------------------------
% 0.21/0.53 % (32470)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (32470)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (32470)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (32470)Memory used [KB]: 6268
% 0.21/0.53 % (32470)Time elapsed: 0.092 s
% 0.21/0.53 % (32470)Instructions burned: 13 (million)
% 0.21/0.53 % (32470)------------------------------
% 0.21/0.53 % (32470)------------------------------
% 0.21/0.53 % (32447)Success in time 0.157 s
%------------------------------------------------------------------------------