TSTP Solution File: SET692+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET692+4 : 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 : n005.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:54 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 77 ( 3 unt; 0 def)
% Number of atoms : 238 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 261 ( 100 ~; 118 |; 27 &)
% ( 11 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 127 ( 118 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f346,plain,
$false,
inference(avatar_sat_refutation,[],[f50,f51,f98,f301,f345]) ).
fof(f345,plain,
( spl3_2
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f344,plain,
( $false
| spl3_2
| ~ spl3_6 ),
inference(subsumption_resolution,[],[f343,f81]) ).
fof(f81,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(duplicate_literal_removal,[],[f77]) ).
fof(f77,plain,
! [X0,X1] :
( subset(intersection(X0,X1),X0)
| subset(intersection(X0,X1),X0) ),
inference(resolution,[],[f56,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) ) )
& ( ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
=> ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) )
& ( ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) ) )
& ( ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( ~ member(X2,X1)
| member(X2,X0) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f56,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f39,f33]) ).
fof(f33,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X0,X2))
| member(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) )
& ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X2,X0] :
( ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X1,X2,X0] :
( ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X2,X0] :
( member(X2,intersection(X1,X0))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( ( member(X2,X0)
& member(X2,X1) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f343,plain,
( ~ subset(intersection(sK1,sK2),sK1)
| spl3_2
| ~ spl3_6 ),
inference(subsumption_resolution,[],[f342,f48]) ).
fof(f48,plain,
( ~ equal_set(sK1,intersection(sK1,sK2))
| spl3_2 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f47,plain,
( spl3_2
<=> equal_set(sK1,intersection(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f342,plain,
( equal_set(sK1,intersection(sK1,sK2))
| ~ subset(intersection(sK1,sK2),sK1)
| ~ spl3_6 ),
inference(resolution,[],[f332,f36]) ).
fof(f36,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) )
& ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) )
& ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) )
& ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f332,plain,
( subset(sK1,intersection(sK1,sK2))
| ~ spl3_6 ),
inference(duplicate_literal_removal,[],[f328]) ).
fof(f328,plain,
( subset(sK1,intersection(sK1,sK2))
| subset(sK1,intersection(sK1,sK2))
| ~ spl3_6 ),
inference(resolution,[],[f310,f33]) ).
fof(f310,plain,
( ! [X1] :
( ~ member(sK0(sK1,intersection(X1,sK2)),X1)
| subset(sK1,intersection(X1,sK2)) )
| ~ spl3_6 ),
inference(duplicate_literal_removal,[],[f308]) ).
fof(f308,plain,
( ! [X1] :
( subset(sK1,intersection(X1,sK2))
| ~ member(sK0(sK1,intersection(X1,sK2)),X1)
| subset(sK1,intersection(X1,sK2)) )
| ~ spl3_6 ),
inference(resolution,[],[f299,f68]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ member(sK0(X0,intersection(X1,X2)),X2)
| ~ member(sK0(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[],[f41,f32]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f299,plain,
( ! [X1] :
( member(sK0(sK1,X1),sK2)
| subset(sK1,X1) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f298,plain,
( spl3_6
<=> ! [X1] :
( member(sK0(sK1,X1),sK2)
| subset(sK1,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f301,plain,
( spl3_6
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f292,f43,f298]) ).
fof(f43,plain,
( spl3_1
<=> subset(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f292,plain,
( ! [X0] :
( member(sK0(sK1,X0),sK2)
| subset(sK1,X0) )
| ~ spl3_1 ),
inference(duplicate_literal_removal,[],[f287]) ).
fof(f287,plain,
( ! [X0] :
( subset(sK1,X0)
| subset(sK1,X0)
| member(sK0(sK1,X0),sK2) )
| ~ spl3_1 ),
inference(resolution,[],[f151,f33]) ).
fof(f151,plain,
( ! [X0,X1] :
( ~ member(sK0(sK1,X0),X1)
| subset(sK1,X0)
| member(sK0(sK1,X0),sK2) )
| ~ spl3_1 ),
inference(resolution,[],[f127,f33]) ).
fof(f127,plain,
( ! [X0,X1] :
( ~ member(X0,sK1)
| member(X0,sK2)
| ~ member(X0,X1) )
| ~ spl3_1 ),
inference(resolution,[],[f125,f71]) ).
fof(f71,plain,
! [X10,X11,X9,X12] :
( ~ subset(intersection(X11,X10),X12)
| ~ member(X9,X11)
| ~ member(X9,X10)
| member(X9,X12) ),
inference(resolution,[],[f41,f31]) ).
fof(f31,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| ~ subset(X0,X1)
| member(X3,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f125,plain,
( ! [X0] : subset(intersection(X0,sK1),sK2)
| ~ spl3_1 ),
inference(resolution,[],[f123,f88]) ).
fof(f88,plain,
! [X0,X1] : subset(intersection(X0,X1),X1),
inference(duplicate_literal_removal,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( subset(intersection(X0,X1),X1)
| subset(intersection(X0,X1),X1) ),
inference(resolution,[],[f57,f32]) ).
fof(f57,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f40,f33]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X0,X2))
| member(X1,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f123,plain,
( ! [X8] :
( ~ subset(X8,sK1)
| subset(X8,sK2) )
| ~ spl3_1 ),
inference(resolution,[],[f119,f45]) ).
fof(f45,plain,
( subset(sK1,sK2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f119,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X2)
| subset(X0,X1) ),
inference(duplicate_literal_removal,[],[f115]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ subset(X0,X2)
| subset(X0,X1)
| ~ subset(X2,X1)
| subset(X0,X1) ),
inference(resolution,[],[f75,f32]) ).
fof(f75,plain,
! [X10,X11,X12,X13] :
( member(sK0(X10,X11),X13)
| subset(X10,X11)
| ~ subset(X12,X13)
| ~ subset(X10,X12) ),
inference(resolution,[],[f58,f31]) ).
fof(f58,plain,
! [X2,X0,X1] :
( member(sK0(X0,X2),X1)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(resolution,[],[f31,f33]) ).
fof(f98,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f97]) ).
fof(f97,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f96,f44]) ).
fof(f44,plain,
( ~ subset(sK1,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f96,plain,
( subset(sK1,sK2)
| ~ spl3_2 ),
inference(duplicate_literal_removal,[],[f94]) ).
fof(f94,plain,
( subset(sK1,sK2)
| subset(sK1,sK2)
| ~ spl3_2 ),
inference(resolution,[],[f90,f32]) ).
fof(f90,plain,
( ! [X0] :
( member(sK0(sK1,X0),sK2)
| subset(sK1,X0) )
| ~ spl3_2 ),
inference(resolution,[],[f73,f52]) ).
fof(f52,plain,
( subset(sK1,intersection(sK1,sK2))
| ~ spl3_2 ),
inference(resolution,[],[f37,f49]) ).
fof(f49,plain,
( equal_set(sK1,intersection(sK1,sK2))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f37,plain,
! [X0,X1] :
( ~ equal_set(X1,X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f73,plain,
! [X2,X3,X4,X5] :
( ~ subset(X2,intersection(X4,X5))
| member(sK0(X2,X3),X5)
| subset(X2,X3) ),
inference(resolution,[],[f58,f40]) ).
fof(f51,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f35,f47,f43]) ).
fof(f35,plain,
( ~ equal_set(sK1,intersection(sK1,sK2))
| ~ subset(sK1,sK2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( ( ~ equal_set(sK1,intersection(sK1,sK2))
| ~ subset(sK1,sK2) )
& ( equal_set(sK1,intersection(sK1,sK2))
| subset(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f22,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( ( ~ equal_set(X0,intersection(X0,X1))
| ~ subset(X0,X1) )
& ( equal_set(X0,intersection(X0,X1))
| subset(X0,X1) ) )
=> ( ( ~ equal_set(sK1,intersection(sK1,sK2))
| ~ subset(sK1,sK2) )
& ( equal_set(sK1,intersection(sK1,sK2))
| subset(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1] :
( ( ~ equal_set(X0,intersection(X0,X1))
| ~ subset(X0,X1) )
& ( equal_set(X0,intersection(X0,X1))
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
? [X0,X1] :
( subset(X0,X1)
<~> equal_set(X0,intersection(X0,X1)) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
<=> equal_set(X0,intersection(X0,X1)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] :
( subset(X0,X1)
<=> equal_set(X0,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI19) ).
fof(f50,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f34,f47,f43]) ).
fof(f34,plain,
( equal_set(sK1,intersection(sK1,sK2))
| subset(sK1,sK2) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET692+4 : TPTP v8.1.0. Released v2.2.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.14/0.34 % Computer : n005.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 14:19:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (30521)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.21/0.50 % (30500)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.21/0.50 % (30504)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51 % (30513)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.51 % (30513)Refutation not found, incomplete strategy% (30513)------------------------------
% 0.21/0.51 % (30513)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (30506)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.21/0.52 % (30513)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (30513)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.52
% 0.21/0.52 % (30513)Memory used [KB]: 5884
% 0.21/0.52 % (30513)Time elapsed: 0.108 s
% 0.21/0.52 % (30513)Instructions burned: 2 (million)
% 0.21/0.52 % (30513)------------------------------
% 0.21/0.52 % (30513)------------------------------
% 0.21/0.52 % (30519)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.52 % (30500)First to succeed.
% 0.21/0.52 % (30511)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (30504)Also succeeded, but the first one will report.
% 0.21/0.52 % (30500)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.52 % (30500)------------------------------
% 0.21/0.52 % (30500)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (30500)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (30500)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (30500)Memory used [KB]: 6140
% 0.21/0.52 % (30500)Time elapsed: 0.105 s
% 0.21/0.52 % (30500)Instructions burned: 14 (million)
% 0.21/0.52 % (30500)------------------------------
% 0.21/0.52 % (30500)------------------------------
% 0.21/0.52 % (30493)Success in time 0.167 s
%------------------------------------------------------------------------------