TSTP Solution File: SEU120+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU120+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 : n016.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.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 2 unt; 0 def)
% Number of atoms : 73 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 41 ~; 24 |; 11 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(avatar_sat_refutation,[],[f48,f49,f61,f80]) ).
fof(f80,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f79]) ).
fof(f79,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f75,f35]) ).
fof(f35,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f33]) ).
fof(f33,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(f75,plain,
( in(sK3,empty_set)
| ~ spl6_1
| ~ spl6_3 ),
inference(backward_demodulation,[],[f39,f65]) ).
fof(f65,plain,
( empty_set = set_intersection2(sK1,sK2)
| ~ spl6_3 ),
inference(unit_resulting_resolution,[],[f47,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| set_intersection2(X1,X0) = empty_set ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( disjoint(X1,X0)
<=> set_intersection2(X1,X0) = empty_set ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f47,plain,
( disjoint(sK1,sK2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f45,plain,
( spl6_3
<=> disjoint(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f39,plain,
( in(sK3,set_intersection2(sK1,sK2))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl6_1
<=> in(sK3,set_intersection2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f61,plain,
( ~ spl6_2
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f60]) ).
fof(f60,plain,
( $false
| ~ spl6_2
| spl6_3 ),
inference(subsumption_resolution,[],[f56,f42]) ).
fof(f42,plain,
( ! [X2] : ~ in(X2,set_intersection2(sK1,sK2))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl6_2
<=> ! [X2] : ~ in(X2,set_intersection2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f56,plain,
( in(sK5(set_intersection2(sK1,sK2)),set_intersection2(sK1,sK2))
| spl6_3 ),
inference(unit_resulting_resolution,[],[f50,f34]) ).
fof(f34,plain,
! [X0] :
( in(sK5(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f3]) ).
fof(f50,plain,
( empty_set != set_intersection2(sK1,sK2)
| spl6_3 ),
inference(unit_resulting_resolution,[],[f46,f27]) ).
fof(f27,plain,
! [X0,X1] :
( set_intersection2(X1,X0) != empty_set
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
( ~ disjoint(sK1,sK2)
| spl6_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f49,plain,
( ~ spl6_3
| spl6_1 ),
inference(avatar_split_clause,[],[f26,f37,f45]) ).
fof(f26,plain,
( in(sK3,set_intersection2(sK1,sK2))
| ~ disjoint(sK1,sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
? [X0,X1] :
( ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
| ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f48,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f24,f41,f45]) ).
fof(f24,plain,
! [X2] :
( ~ in(X2,set_intersection2(sK1,sK2))
| disjoint(sK1,sK2) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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.14/0.34 % Computer : n016.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 Aug 30 15:02:01 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.54 % (8746)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.20/0.54 % (8756)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.20/0.54 % (8748)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.20/0.55 % (8747)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.20/0.55 % (8748)First to succeed.
% 0.20/0.55 % (8754)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.20/0.55 % (8748)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (8748)------------------------------
% 0.20/0.55 % (8748)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (8748)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (8748)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (8748)Memory used [KB]: 5884
% 0.20/0.55 % (8748)Time elapsed: 0.139 s
% 0.20/0.55 % (8748)Instructions burned: 3 (million)
% 0.20/0.55 % (8748)------------------------------
% 0.20/0.55 % (8748)------------------------------
% 0.20/0.55 % (8739)Success in time 0.201 s
%------------------------------------------------------------------------------