TSTP Solution File: SEU119+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU119+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 : n007.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:44 EDT 2022
% Result : Theorem 0.21s 0.49s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 2 unt; 0 def)
% Number of atoms : 126 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 145 ( 64 ~; 51 |; 20 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 56 ( 50 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f195,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f60,f65,f67,f154,f162,f194]) ).
fof(f194,plain,
( spl7_3
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f193,f53,f58]) ).
fof(f58,plain,
( spl7_3
<=> ! [X2] :
( ~ in(X2,sK2)
| ~ in(X2,sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f53,plain,
( spl7_2
<=> disjoint(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f193,plain,
( ! [X2] :
( ~ in(X2,sK2)
| ~ in(X2,sK3) )
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f191,f44]) ).
fof(f44,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( empty_set != X0
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( ! [X1] : ~ in(X1,X0)
<=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f191,plain,
( ! [X2] :
( ~ in(X2,sK2)
| ~ in(X2,sK3)
| in(X2,empty_set) )
| ~ spl7_2 ),
inference(superposition,[],[f45,f164]) ).
fof(f164,plain,
( empty_set = set_intersection2(sK2,sK3)
| ~ spl7_2 ),
inference(unit_resulting_resolution,[],[f54,f24]) ).
fof(f24,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( set_intersection2(X0,X1) = empty_set
<=> disjoint(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f54,plain,
( disjoint(sK2,sK3)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f45,plain,
! [X2,X3,X1] :
( in(X3,set_intersection2(X2,X1))
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1] :
( set_intersection2(X2,X1) != X0
| ~ in(X3,X2)
| ~ in(X3,X1)
| in(X3,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0,X2] :
( ! [X3] :
( in(X3,X0)
<=> ( in(X3,X1)
& in(X3,X2) ) )
<=> set_intersection2(X2,X1) = X0 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f162,plain,
( ~ spl7_4
| ~ spl7_1
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f155,f58,f49,f62]) ).
fof(f62,plain,
( spl7_4
<=> in(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f49,plain,
( spl7_1
<=> in(sK4,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f155,plain,
( ~ in(sK4,sK3)
| ~ spl7_1
| ~ spl7_3 ),
inference(unit_resulting_resolution,[],[f51,f59]) ).
fof(f59,plain,
( ! [X2] :
( ~ in(X2,sK3)
| ~ in(X2,sK2) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f51,plain,
( in(sK4,sK2)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f154,plain,
( spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f153]) ).
fof(f153,plain,
( $false
| spl7_2
| ~ spl7_3 ),
inference(subsumption_resolution,[],[f134,f44]) ).
fof(f134,plain,
( in(sK6(empty_set,sK3,sK2),empty_set)
| spl7_2
| ~ spl7_3 ),
inference(unit_resulting_resolution,[],[f68,f90,f70]) ).
fof(f70,plain,
( ! [X0,X1] :
( ~ in(sK6(X0,sK3,X1),sK2)
| set_intersection2(X1,sK3) = X0
| in(sK6(X0,sK3,X1),X0) )
| ~ spl7_3 ),
inference(resolution,[],[f59,f43]) ).
fof(f43,plain,
! [X2,X0,X1] :
( in(sK6(X0,X1,X2),X1)
| in(sK6(X0,X1,X2),X0)
| set_intersection2(X2,X1) = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f90,plain,
( in(sK6(empty_set,sK3,sK2),sK2)
| spl7_2 ),
inference(unit_resulting_resolution,[],[f44,f68,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( in(sK6(X0,X1,X2),X2)
| in(sK6(X0,X1,X2),X0)
| set_intersection2(X2,X1) = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f68,plain,
( empty_set != set_intersection2(sK2,sK3)
| spl7_2 ),
inference(unit_resulting_resolution,[],[f55,f25]) ).
fof(f25,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f55,plain,
( ~ disjoint(sK2,sK3)
| spl7_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f67,plain,
( spl7_4
| spl7_3 ),
inference(avatar_split_clause,[],[f33,f58,f62]) ).
fof(f33,plain,
! [X2] :
( ~ in(X2,sK3)
| in(sK4,sK3)
| ~ in(X2,sK2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
? [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X1)
| ~ in(X2,X0) )
& ~ disjoint(X1,X0) )
| ( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
& disjoint(X1,X0) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
~ ! [X1,X0] :
( ~ ( ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) )
& ~ disjoint(X1,X0) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
& disjoint(X1,X0) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X1,X0] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) ) )
& ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X0)
& in(X2,X1) ) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X1,X0] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) ) )
& ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X0)
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f65,plain,
( spl7_4
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f34,f53,f62]) ).
fof(f34,plain,
( ~ disjoint(sK2,sK3)
| in(sK4,sK3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f60,plain,
( spl7_2
| spl7_3 ),
inference(avatar_split_clause,[],[f31,f58,f53]) ).
fof(f31,plain,
! [X2] :
( ~ in(X2,sK2)
| disjoint(sK2,sK3)
| ~ in(X2,sK3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f56,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f35,f53,f49]) ).
fof(f35,plain,
( ~ disjoint(sK2,sK3)
| in(sK4,sK2) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU119+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 14:24:31 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.45 % (31238)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.21/0.47 % (31246)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.47 % (31255)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.48 % (31246)First to succeed.
% 0.21/0.49 % (31246)Refutation found. Thanks to Tanya!
% 0.21/0.49 % SZS status Theorem for theBenchmark
% 0.21/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.49 % (31246)------------------------------
% 0.21/0.49 % (31246)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (31246)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49 % (31246)Termination reason: Refutation
% 0.21/0.49
% 0.21/0.49 % (31246)Memory used [KB]: 6012
% 0.21/0.49 % (31246)Time elapsed: 0.097 s
% 0.21/0.49 % (31246)Instructions burned: 6 (million)
% 0.21/0.49 % (31246)------------------------------
% 0.21/0.49 % (31246)------------------------------
% 0.21/0.49 % (31235)Success in time 0.135 s
%------------------------------------------------------------------------------