TSTP Solution File: SET175+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET175+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 : n003.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:04 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 11 unt; 0 def)
% Number of atoms : 144 ( 17 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 161 ( 65 ~; 57 |; 29 &)
% ( 7 <=>; 3 =>; 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 : 82 ( 73 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(subsumption_resolution,[],[f100,f85]) ).
fof(f85,plain,
~ member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2),
inference(subsumption_resolution,[],[f84,f79]) ).
fof(f79,plain,
( member(sK0(union(sK2,intersection(sK2,sK1)),sK2),sK2)
| ~ member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2) ),
inference(resolution,[],[f78,f39]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X1,X0)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( ~ member(X3,X1)
| member(X3,X0) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) )
=> ( member(sK0(X0,X1),X1)
& ~ member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) ) )
& ( ! [X3] :
( ~ member(X3,X1)
| member(X3,X0) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) )
& ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f78,plain,
( ~ subset(sK2,union(sK2,intersection(sK2,sK1)))
| ~ member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2) ),
inference(resolution,[],[f72,f38]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f72,plain,
( ~ subset(union(sK2,intersection(sK2,sK1)),sK2)
| ~ subset(sK2,union(sK2,intersection(sK2,sK1))) ),
inference(extensionality_resolution,[],[f43,f45]) ).
fof(f45,plain,
sK2 != union(sK2,intersection(sK2,sK1)),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
sK2 != union(sK2,intersection(sK2,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f24,f25]) ).
fof(f25,plain,
( ? [X0,X1] : union(X1,intersection(X1,X0)) != X1
=> sK2 != union(sK2,intersection(sK2,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
? [X0,X1] : union(X1,intersection(X1,X0)) != X1,
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X1,X0] : union(X0,intersection(X0,X1)) != X0,
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X0] : union(X0,intersection(X0,X1)) = X0,
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X0] : union(X0,intersection(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion_for_union) ).
fof(f43,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
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(f84,plain,
( ~ member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2)
| ~ member(sK0(union(sK2,intersection(sK2,sK1)),sK2),sK2) ),
inference(resolution,[],[f80,f51]) ).
fof(f51,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X0,X2,X1] :
( ( member(X1,union(X0,X2))
| ( ~ member(X1,X2)
& ~ member(X1,X0) ) )
& ( member(X1,X2)
| member(X1,X0)
| ~ member(X1,union(X0,X2)) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X2,X1] :
( ( member(X1,union(X0,X2))
| ( ~ member(X1,X2)
& ~ member(X1,X0) ) )
& ( member(X1,X2)
| member(X1,X0)
| ~ member(X1,union(X0,X2)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X2,X1] :
( member(X1,union(X0,X2))
<=> ( member(X1,X2)
| member(X1,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X2,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f80,plain,
( ~ member(sK0(union(sK2,intersection(sK2,sK1)),sK2),union(sK2,intersection(sK2,sK1)))
| ~ member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2) ),
inference(resolution,[],[f78,f38]) ).
fof(f100,plain,
member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2),
inference(resolution,[],[f98,f47]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X2,X1)) )
& ( member(X0,intersection(X2,X1))
| ~ member(X0,X1)
| ~ member(X0,X2) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X2,X1,X0] :
( ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) )
& ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X2,X1,X0] :
( ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) )
& ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f98,plain,
member(sK0(sK2,union(sK2,intersection(sK2,sK1))),intersection(sK2,sK1)),
inference(subsumption_resolution,[],[f95,f85]) ).
fof(f95,plain,
( member(sK0(sK2,union(sK2,intersection(sK2,sK1))),intersection(sK2,sK1))
| member(sK0(sK2,union(sK2,intersection(sK2,sK1))),sK2) ),
inference(resolution,[],[f50,f88]) ).
fof(f88,plain,
member(sK0(sK2,union(sK2,intersection(sK2,sK1))),union(sK2,intersection(sK2,sK1))),
inference(subsumption_resolution,[],[f87,f81]) ).
fof(f81,plain,
( member(sK0(union(sK2,intersection(sK2,sK1)),sK2),sK2)
| member(sK0(sK2,union(sK2,intersection(sK2,sK1))),union(sK2,intersection(sK2,sK1))) ),
inference(resolution,[],[f77,f39]) ).
fof(f77,plain,
( ~ subset(sK2,union(sK2,intersection(sK2,sK1)))
| member(sK0(sK2,union(sK2,intersection(sK2,sK1))),union(sK2,intersection(sK2,sK1))) ),
inference(resolution,[],[f72,f39]) ).
fof(f87,plain,
( ~ member(sK0(union(sK2,intersection(sK2,sK1)),sK2),sK2)
| member(sK0(sK2,union(sK2,intersection(sK2,sK1))),union(sK2,intersection(sK2,sK1))) ),
inference(resolution,[],[f82,f51]) ).
fof(f82,plain,
( ~ member(sK0(union(sK2,intersection(sK2,sK1)),sK2),union(sK2,intersection(sK2,sK1)))
| member(sK0(sK2,union(sK2,intersection(sK2,sK1))),union(sK2,intersection(sK2,sK1))) ),
inference(resolution,[],[f77,f38]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/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.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 13:32:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (3149)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.50 % (3143)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.50 % (3140)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 (3000ds/191324Mi)
% 0.19/0.50 % (3150)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.50 TRYING [1]
% 0.19/0.50 % (3141)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.51 % (3165)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.19/0.51 % (3162)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 (3000ds/498Mi)
% 0.19/0.51 % (3160)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 0.19/0.51 % (3153)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.19/0.51 % (3157)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.19/0.51 % (3152)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.51 TRYING [2]
% 0.19/0.51 TRYING [3]
% 0.19/0.51 % (3154)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 (3000ds/68Mi)
% 0.19/0.51 TRYING [4]
% 0.19/0.51 % (3141)Refutation not found, incomplete strategy% (3141)------------------------------
% 0.19/0.51 % (3141)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (3141)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (3141)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (3141)Memory used [KB]: 5373
% 0.19/0.51 % (3141)Time elapsed: 0.118 s
% 0.19/0.51 % (3141)Instructions burned: 2 (million)
% 0.19/0.51 % (3141)------------------------------
% 0.19/0.51 % (3141)------------------------------
% 0.19/0.51 % (3162)First to succeed.
% 0.19/0.52 % (3151)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.52 % (3146)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.52 % (3158)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.52 % (3145)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 (3000ds/48Mi)
% 0.19/0.52 TRYING [1]
% 0.19/0.52 % (3164)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.19/0.52 % (3144)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.52 TRYING [2]
% 0.19/0.52 TRYING [1]
% 0.19/0.52 TRYING [2]
% 0.19/0.52 TRYING [3]
% 0.19/0.52 TRYING [3]
% 0.19/0.52 % (3153)Also succeeded, but the first one will report.
% 0.19/0.52 % (3147)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.53 % (3162)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (3162)------------------------------
% 0.19/0.53 % (3162)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (3162)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (3162)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (3162)Memory used [KB]: 895
% 0.19/0.53 % (3162)Time elapsed: 0.089 s
% 0.19/0.53 % (3162)Instructions burned: 5 (million)
% 0.19/0.53 % (3162)------------------------------
% 0.19/0.53 % (3162)------------------------------
% 0.19/0.53 % (3139)Success in time 0.175 s
%------------------------------------------------------------------------------