TSTP Solution File: SET173+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET173+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_sat --cores 0 -t %d %s
% Computer : n004.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:24:03 EDT 2022
% Result : Theorem 1.28s 0.52s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 10 unt; 0 def)
% Number of atoms : 157 ( 17 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 179 ( 74 ~; 62 |; 30 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 79 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(subsumption_resolution,[],[f100,f95]) ).
fof(f95,plain,
~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2),
inference(subsumption_resolution,[],[f93,f79]) ).
fof(f79,plain,
( member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2)
| ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2) ),
inference(resolution,[],[f76,f56]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X1,X0)
| member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ member(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
=> ( ~ member(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) ) ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f76,plain,
( ~ subset(sK2,intersection(sK2,union(sK2,sK1)))
| ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2) ),
inference(resolution,[],[f71,f57]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f71,plain,
( ~ subset(intersection(sK2,union(sK2,sK1)),sK2)
| ~ subset(sK2,intersection(sK2,union(sK2,sK1))) ),
inference(extensionality_resolution,[],[f50,f49]) ).
fof(f49,plain,
intersection(sK2,union(sK2,sK1)) != sK2,
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
intersection(sK2,union(sK2,sK1)) != sK2,
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1] : intersection(X1,union(X1,X0)) != X1
=> intersection(sK2,union(sK2,sK1)) != sK2 ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1] : intersection(X1,union(X1,X0)) != X1,
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X1,X0] : intersection(X0,union(X0,X1)) != X0,
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] : intersection(X0,union(X0,X1)) = X0,
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1] : intersection(X0,union(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion_for_intersection) ).
fof(f50,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f93,plain,
( ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2)
| ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2) ),
inference(resolution,[],[f91,f54]) ).
fof(f54,plain,
! [X2,X0,X1] :
( member(X1,union(X0,X2))
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( member(X1,X0)
| member(X1,X2)
| ~ member(X1,union(X0,X2)) )
& ( member(X1,union(X0,X2))
| ( ~ member(X1,X0)
& ~ member(X1,X2) ) ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X1,X2,X0] :
( ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X1,X0)) )
& ( member(X2,union(X1,X0))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X1,X2,X0] :
( ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X1,X0)) )
& ( member(X2,union(X1,X0))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X2,X0] :
( ( member(X2,X1)
| member(X2,X0) )
<=> member(X2,union(X1,X0)) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f91,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),union(sK2,sK1))
| ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2) ),
inference(subsumption_resolution,[],[f88,f79]) ).
fof(f88,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2)
| ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),union(sK2,sK1))
| ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2) ),
inference(resolution,[],[f45,f78]) ).
fof(f78,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),intersection(sK2,union(sK2,sK1)))
| ~ member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2) ),
inference(resolution,[],[f76,f57]) ).
fof(f45,plain,
! [X2,X0,X1] :
( member(X1,intersection(X2,X0))
| ~ member(X1,X2)
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X2,X0)) )
& ( member(X1,intersection(X2,X0))
| ~ member(X1,X0)
| ~ member(X1,X2) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) )
& ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) )
& ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ( member(X0,X2)
& member(X0,X1) )
<=> member(X0,intersection(X1,X2)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f100,plain,
member(sK3(sK2,intersection(sK2,union(sK2,sK1))),sK2),
inference(resolution,[],[f98,f46]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X2,X0))
| member(X1,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f98,plain,
member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))),
inference(subsumption_resolution,[],[f96,f81]) ).
fof(f81,plain,
( member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2)
| member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))) ),
inference(resolution,[],[f77,f56]) ).
fof(f77,plain,
( ~ subset(sK2,intersection(sK2,union(sK2,sK1)))
| member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))) ),
inference(resolution,[],[f71,f56]) ).
fof(f96,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2)
| member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))) ),
inference(resolution,[],[f92,f54]) ).
fof(f92,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),union(sK2,sK1))
| member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))) ),
inference(subsumption_resolution,[],[f87,f81]) ).
fof(f87,plain,
( member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1)))
| ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),sK2)
| ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),union(sK2,sK1)) ),
inference(resolution,[],[f45,f80]) ).
fof(f80,plain,
( ~ member(sK3(intersection(sK2,union(sK2,sK1)),sK2),intersection(sK2,union(sK2,sK1)))
| member(sK3(sK2,intersection(sK2,union(sK2,sK1))),intersection(sK2,union(sK2,sK1))) ),
inference(resolution,[],[f77,f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET173+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 13:25:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 % (13089)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.47 TRYING [1]
% 0.20/0.47 TRYING [2]
% 0.20/0.48 TRYING [3]
% 0.20/0.48 % (13113)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.48 TRYING [4]
% 0.20/0.49 % (13091)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (13083)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.50 % (13091)Instruction limit reached!
% 0.20/0.50 % (13091)------------------------------
% 0.20/0.50 % (13091)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (13091)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (13091)Termination reason: Unknown
% 0.20/0.50 % (13091)Termination phase: Saturation
% 0.20/0.50
% 0.20/0.50 % (13091)Memory used [KB]: 5373
% 0.20/0.50 % (13091)Time elapsed: 0.094 s
% 0.20/0.50 % (13091)Instructions burned: 3 (million)
% 0.20/0.50 % (13091)------------------------------
% 0.20/0.50 % (13091)------------------------------
% 0.20/0.50 TRYING [1]
% 0.20/0.50 TRYING [2]
% 0.20/0.50 % (13085)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.50 TRYING [3]
% 0.20/0.50 % (13107)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (13105)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.51 % (13093)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (13106)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.51 TRYING [4]
% 0.20/0.51 % (13098)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51 % (13099)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.51 % (13088)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (13086)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (13087)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (13106)First to succeed.
% 1.28/0.52 TRYING [5]
% 1.28/0.52 % (13109)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.28/0.52 % (13106)Refutation found. Thanks to Tanya!
% 1.28/0.52 % SZS status Theorem for theBenchmark
% 1.28/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.28/0.52 % (13106)------------------------------
% 1.28/0.52 % (13106)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.52 % (13106)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.52 % (13106)Termination reason: Refutation
% 1.28/0.52
% 1.28/0.52 % (13106)Memory used [KB]: 895
% 1.28/0.52 % (13106)Time elapsed: 0.116 s
% 1.28/0.52 % (13106)Instructions burned: 5 (million)
% 1.28/0.52 % (13106)------------------------------
% 1.28/0.52 % (13106)------------------------------
% 1.28/0.52 % (13080)Success in time 0.165 s
%------------------------------------------------------------------------------