TSTP Solution File: SET624+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET624+3 : TPTP v8.1.0. Released v2.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 : n013.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:21:39 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 72 ( 1 unt; 0 def)
% Number of atoms : 240 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 276 ( 108 ~; 126 |; 28 &)
% ( 11 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 69 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f369,plain,
$false,
inference(avatar_sat_refutation,[],[f59,f60,f61,f115,f142,f301,f352,f367]) ).
fof(f367,plain,
( spl5_3
| ~ spl5_9 ),
inference(avatar_contradiction_clause,[],[f366]) ).
fof(f366,plain,
( $false
| spl5_3
| ~ spl5_9 ),
inference(subsumption_resolution,[],[f359,f300]) ).
fof(f300,plain,
( ! [X1] : member(sK4(union(sK3,sK2),sK1),X1)
| ~ spl5_9 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f299,plain,
( spl5_9
<=> ! [X1] : member(sK4(union(sK3,sK2),sK1),X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_9])]) ).
fof(f359,plain,
( ~ member(sK4(union(sK3,sK2),sK1),sK1)
| spl5_3
| ~ spl5_9 ),
inference(resolution,[],[f300,f143]) ).
fof(f143,plain,
( ! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,sK1) )
| spl5_3 ),
inference(resolution,[],[f57,f42]) ).
fof(f42,plain,
! [X3,X0,X1] :
( intersect(X1,X0)
| ~ member(X3,X1)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( ( member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
=> ( member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X3] :
( ~ member(X3,X0)
| ~ member(X3,X1) ) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X1,X0) )
& ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
<=> intersect(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
<=> intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f57,plain,
( ~ intersect(sK1,sK2)
| spl5_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f56,plain,
( spl5_3
<=> intersect(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f352,plain,
( spl5_8
| ~ spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f351,f56,f48,f295]) ).
fof(f295,plain,
( spl5_8
<=> member(sK4(union(sK3,sK2),sK1),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_8])]) ).
fof(f48,plain,
( spl5_1
<=> intersect(sK1,union(sK3,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f351,plain,
( member(sK4(union(sK3,sK2),sK1),sK3)
| ~ spl5_1
| spl5_3 ),
inference(subsumption_resolution,[],[f326,f50]) ).
fof(f50,plain,
( intersect(sK1,union(sK3,sK2))
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f326,plain,
( member(sK4(union(sK3,sK2),sK1),sK3)
| ~ intersect(sK1,union(sK3,sK2))
| ~ spl5_1
| spl5_3 ),
inference(resolution,[],[f221,f44]) ).
fof(f44,plain,
! [X0,X1] :
( member(sK4(X0,X1),X0)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f221,plain,
( ! [X0] :
( ~ member(sK4(union(sK3,sK2),sK1),union(X0,sK2))
| member(sK4(union(sK3,sK2),sK1),X0) )
| ~ spl5_1
| spl5_3 ),
inference(resolution,[],[f197,f50]) ).
fof(f197,plain,
( ! [X4,X5] :
( ~ intersect(sK1,X4)
| ~ member(sK4(X4,sK1),union(X5,sK2))
| member(sK4(X4,sK1),X5) )
| spl5_3 ),
inference(resolution,[],[f152,f43]) ).
fof(f43,plain,
! [X0,X1] :
( member(sK4(X0,X1),X1)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f152,plain,
( ! [X3,X4] :
( ~ member(X3,sK1)
| member(X3,X4)
| ~ member(X3,union(X4,sK2)) )
| spl5_3 ),
inference(resolution,[],[f143,f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X0,union(X2,X1))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X2,X1,X0] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X2,X1,X0] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X2,X1,X0] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f301,plain,
( ~ spl5_8
| spl5_9
| ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f287,f52,f48,f299,f295]) ).
fof(f52,plain,
( spl5_2
<=> intersect(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f287,plain,
( ! [X1] :
( member(sK4(union(sK3,sK2),sK1),X1)
| ~ member(sK4(union(sK3,sK2),sK1),sK3) )
| ~ spl5_1
| spl5_2 ),
inference(resolution,[],[f215,f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f215,plain,
( ! [X0] :
( ~ member(sK4(union(sK3,sK2),sK1),union(X0,sK3))
| member(sK4(union(sK3,sK2),sK1),X0) )
| ~ spl5_1
| spl5_2 ),
inference(resolution,[],[f192,f50]) ).
fof(f192,plain,
( ! [X4,X5] :
( ~ intersect(sK1,X4)
| member(sK4(X4,sK1),X5)
| ~ member(sK4(X4,sK1),union(X5,sK3)) )
| spl5_2 ),
inference(resolution,[],[f125,f43]) ).
fof(f125,plain,
( ! [X4,X5] :
( ~ member(X4,sK1)
| member(X4,X5)
| ~ member(X4,union(X5,sK3)) )
| spl5_2 ),
inference(resolution,[],[f116,f39]) ).
fof(f116,plain,
( ! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK1) )
| spl5_2 ),
inference(resolution,[],[f53,f42]) ).
fof(f53,plain,
( ~ intersect(sK1,sK3)
| spl5_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f142,plain,
( spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f141,plain,
( $false
| spl5_1
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f136,f58]) ).
fof(f58,plain,
( intersect(sK1,sK2)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f136,plain,
( ~ intersect(sK1,sK2)
| spl5_1
| ~ spl5_3 ),
inference(resolution,[],[f128,f44]) ).
fof(f128,plain,
( ~ member(sK4(sK2,sK1),sK2)
| spl5_1
| ~ spl5_3 ),
inference(resolution,[],[f118,f41]) ).
fof(f118,plain,
( ~ member(sK4(sK2,sK1),union(sK3,sK2))
| spl5_1
| ~ spl5_3 ),
inference(resolution,[],[f58,f74]) ).
fof(f74,plain,
( ! [X2] :
( ~ intersect(sK1,X2)
| ~ member(sK4(X2,sK1),union(sK3,sK2)) )
| spl5_1 ),
inference(resolution,[],[f62,f43]) ).
fof(f62,plain,
( ! [X0] :
( ~ member(X0,sK1)
| ~ member(X0,union(sK3,sK2)) )
| spl5_1 ),
inference(resolution,[],[f49,f42]) ).
fof(f49,plain,
( ~ intersect(sK1,union(sK3,sK2))
| spl5_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f115,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f114]) ).
fof(f114,plain,
( $false
| spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f109,f54]) ).
fof(f54,plain,
( intersect(sK1,sK3)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f109,plain,
( ~ intersect(sK1,sK3)
| spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f90,f44]) ).
fof(f90,plain,
( ~ member(sK4(sK3,sK1),sK3)
| spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f84,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X0,union(X2,X1))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f84,plain,
( ~ member(sK4(sK3,sK1),union(sK3,sK2))
| spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f74,f54]) ).
fof(f61,plain,
( ~ spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f38,f48,f52]) ).
fof(f38,plain,
( ~ intersect(sK1,union(sK3,sK2))
| ~ intersect(sK1,sK3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ( ( ~ intersect(sK1,sK3)
& ~ intersect(sK1,sK2) )
| ~ intersect(sK1,union(sK3,sK2)) )
& ( intersect(sK1,sK3)
| intersect(sK1,sK2)
| intersect(sK1,union(sK3,sK2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1,X2] :
( ( ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) )
| ~ intersect(X0,union(X2,X1)) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| intersect(X0,union(X2,X1)) ) )
=> ( ( ( ~ intersect(sK1,sK3)
& ~ intersect(sK1,sK2) )
| ~ intersect(sK1,union(sK3,sK2)) )
& ( intersect(sK1,sK3)
| intersect(sK1,sK2)
| intersect(sK1,union(sK3,sK2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ( ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) )
| ~ intersect(X0,union(X2,X1)) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| intersect(X0,union(X2,X1)) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
? [X2,X1,X0] :
( ( ( ~ intersect(X2,X0)
& ~ intersect(X2,X1) )
| ~ intersect(X2,union(X0,X1)) )
& ( intersect(X2,X0)
| intersect(X2,X1)
| intersect(X2,union(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
? [X2,X1,X0] :
( ( ( ~ intersect(X2,X0)
& ~ intersect(X2,X1) )
| ~ intersect(X2,union(X0,X1)) )
& ( intersect(X2,X0)
| intersect(X2,X1)
| intersect(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X2,X1,X0] :
( intersect(X2,union(X0,X1))
<~> ( intersect(X2,X0)
| intersect(X2,X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ! [X2,X0,X1] :
( ( intersect(X2,X0)
| intersect(X2,X1) )
<=> intersect(X2,union(X0,X1)) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X1,X2,X0] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X1)
| intersect(X0,X2) ) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X1,X2,X0] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X1)
| intersect(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersect_with_union) ).
fof(f60,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f37,f56,f48]) ).
fof(f37,plain,
( ~ intersect(sK1,sK2)
| ~ intersect(sK1,union(sK3,sK2)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f59,plain,
( spl5_1
| spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f36,f56,f52,f48]) ).
fof(f36,plain,
( intersect(sK1,sK2)
| intersect(sK1,sK3)
| intersect(sK1,union(sK3,sK2)) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/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.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 14:02:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 % (7132)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.19/0.47 % (7132)Instruction limit reached!
% 0.19/0.47 % (7132)------------------------------
% 0.19/0.47 % (7132)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (7154)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48 % (7146)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.49 % (7140)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.19/0.49 % (7132)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (7132)Termination reason: Unknown
% 0.19/0.49 % (7132)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (7132)Memory used [KB]: 6140
% 0.19/0.49 % (7132)Time elapsed: 0.087 s
% 0.19/0.49 % (7132)Instructions burned: 13 (million)
% 0.19/0.49 % (7132)------------------------------
% 0.19/0.49 % (7132)------------------------------
% 0.19/0.49 % (7146)Instruction limit reached!
% 0.19/0.49 % (7146)------------------------------
% 0.19/0.49 % (7146)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (7146)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (7146)Termination reason: Unknown
% 0.19/0.49 % (7146)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (7146)Memory used [KB]: 5884
% 0.19/0.49 % (7146)Time elapsed: 0.114 s
% 0.19/0.49 % (7146)Instructions burned: 3 (million)
% 0.19/0.49 % (7146)------------------------------
% 0.19/0.49 % (7146)------------------------------
% 0.19/0.50 % (7136)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.19/0.50 % (7140)Instruction limit reached!
% 0.19/0.50 % (7140)------------------------------
% 0.19/0.50 % (7140)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (7140)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (7140)Termination reason: Unknown
% 0.19/0.50 % (7140)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (7140)Memory used [KB]: 1535
% 0.19/0.50 % (7140)Time elapsed: 0.120 s
% 0.19/0.50 % (7140)Instructions burned: 16 (million)
% 0.19/0.50 % (7140)------------------------------
% 0.19/0.50 % (7140)------------------------------
% 0.19/0.51 % (7154)First to succeed.
% 0.19/0.51 % (7154)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (7154)------------------------------
% 0.19/0.51 % (7154)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (7154)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (7154)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (7154)Memory used [KB]: 6268
% 0.19/0.51 % (7154)Time elapsed: 0.116 s
% 0.19/0.51 % (7154)Instructions burned: 16 (million)
% 0.19/0.51 % (7154)------------------------------
% 0.19/0.51 % (7154)------------------------------
% 0.19/0.51 % (7127)Success in time 0.162 s
%------------------------------------------------------------------------------