TSTP Solution File: SET594+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET594+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 : n007.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:32 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 140 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 137 ( 52 ~; 48 |; 25 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 98 ( 86 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f246,plain,
$false,
inference(subsumption_resolution,[],[f245,f64]) ).
fof(f64,plain,
~ subset(sK1,sF5),
inference(definition_folding,[],[f45,f63]) ).
fof(f63,plain,
sF5 = union(sK3,sK2),
introduced(function_definition,[]) ).
fof(f45,plain,
~ subset(sK1,union(sK3,sK2)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ~ subset(sK1,union(sK3,sK2))
& union(intersection(sK1,sK3),intersection(sK1,sK2)) = sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,union(X2,X1))
& union(intersection(X0,X2),intersection(X0,X1)) = X0 )
=> ( ~ subset(sK1,union(sK3,sK2))
& union(intersection(sK1,sK3),intersection(sK1,sK2)) = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ~ subset(X0,union(X2,X1))
& union(intersection(X0,X2),intersection(X0,X1)) = X0 ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
? [X1,X2,X0] :
( ~ subset(X1,union(X0,X2))
& union(intersection(X1,X0),intersection(X1,X2)) = X1 ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1,X2] :
( union(intersection(X1,X0),intersection(X1,X2)) = X1
=> subset(X1,union(X0,X2)) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X0,X2] :
( union(intersection(X0,X1),intersection(X0,X2)) = X0
=> subset(X0,union(X1,X2)) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X0,X2] :
( union(intersection(X0,X1),intersection(X0,X2)) = X0
=> subset(X0,union(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th53) ).
fof(f245,plain,
subset(sK1,sF5),
inference(duplicate_literal_removal,[],[f241]) ).
fof(f241,plain,
( subset(sK1,sF5)
| subset(sK1,sF5) ),
inference(resolution,[],[f240,f42]) ).
fof(f42,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f24]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f240,plain,
! [X2] :
( ~ member(sK0(X2,sF5),sK1)
| subset(X2,sF5) ),
inference(subsumption_resolution,[],[f238,f170]) ).
fof(f170,plain,
! [X0] :
( ~ member(sK0(X0,sF5),sF6)
| subset(X0,sF5) ),
inference(resolution,[],[f98,f81]) ).
fof(f81,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sF6) ),
inference(superposition,[],[f47,f65]) ).
fof(f65,plain,
intersection(sK1,sK3) = sF6,
introduced(function_definition,[]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) )
& ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) )
& ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X2,X0,X1] :
( member(X1,intersection(X0,X2))
<=> ( member(X1,X2)
& member(X1,X0) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X2,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f98,plain,
! [X0] :
( ~ member(sK0(X0,sF5),sK3)
| subset(X0,sF5) ),
inference(resolution,[],[f97,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f97,plain,
! [X7] :
( member(X7,sF5)
| ~ member(X7,sK3) ),
inference(superposition,[],[f58,f70]) ).
fof(f70,plain,
sF5 = union(sK2,sK3),
inference(backward_demodulation,[],[f63,f55]) ).
fof(f55,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f58,plain,
! [X2,X0,X1] :
( member(X2,union(X1,X0))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( member(X2,union(X1,X0))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X1,X0)) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( member(X2,union(X1,X0))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X1,X0)) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( member(X2,union(X1,X0))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0,X2] :
( ( member(X2,X0)
| member(X2,X1) )
<=> member(X2,union(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f238,plain,
! [X2] :
( subset(X2,sF5)
| ~ member(sK0(X2,sF5),sK1)
| member(sK0(X2,sF5),sF6) ),
inference(resolution,[],[f228,f156]) ).
fof(f156,plain,
! [X0] :
( ~ member(sK0(X0,sF5),sF7)
| subset(X0,sF5) ),
inference(resolution,[],[f92,f82]) ).
fof(f82,plain,
! [X1] :
( member(X1,sK2)
| ~ member(X1,sF7) ),
inference(superposition,[],[f47,f66]) ).
fof(f66,plain,
intersection(sK1,sK2) = sF7,
introduced(function_definition,[]) ).
fof(f92,plain,
! [X0] :
( ~ member(sK0(X0,sF5),sK2)
| subset(X0,sF5) ),
inference(resolution,[],[f91,f43]) ).
fof(f91,plain,
! [X7] :
( member(X7,sF5)
| ~ member(X7,sK2) ),
inference(superposition,[],[f57,f70]) ).
fof(f57,plain,
! [X2,X0,X1] :
( member(X2,union(X1,X0))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f228,plain,
! [X0] :
( member(X0,sF7)
| member(X0,sF6)
| ~ member(X0,sK1) ),
inference(superposition,[],[f56,f69]) ).
fof(f69,plain,
sK1 = union(sF6,sF7),
inference(forward_demodulation,[],[f67,f68]) ).
fof(f68,plain,
sK1 = sF8,
inference(definition_folding,[],[f44,f67,f66,f65]) ).
fof(f44,plain,
union(intersection(sK1,sK3),intersection(sK1,sK2)) = sK1,
inference(cnf_transformation,[],[f28]) ).
fof(f67,plain,
union(sF6,sF7) = sF8,
introduced(function_definition,[]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X1,X0))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET594+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_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n007.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:46:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (28555)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (28577)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.52 % (28568)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (28556)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (28553)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52 % (28555)Refutation not found, incomplete strategy% (28555)------------------------------
% 0.20/0.52 % (28555)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (28560)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.53 % (28581)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.20/0.53 % (28579)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.20/0.53 % (28557)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.20/0.53 % (28555)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (28555)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53
% 0.20/0.53 % (28555)Memory used [KB]: 6012
% 0.20/0.53 % (28555)Time elapsed: 0.125 s
% 0.20/0.53 % (28555)Instructions burned: 2 (million)
% 0.20/0.53 % (28555)------------------------------
% 0.20/0.53 % (28555)------------------------------
% 0.20/0.53 % (28568)Instruction limit reached!
% 0.20/0.53 % (28568)------------------------------
% 0.20/0.53 % (28568)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (28568)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (28568)Termination reason: Unknown
% 0.20/0.53 % (28568)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (28568)Memory used [KB]: 6012
% 0.20/0.53 % (28568)Time elapsed: 0.081 s
% 0.20/0.53 % (28568)Instructions burned: 8 (million)
% 0.20/0.53 % (28568)------------------------------
% 0.20/0.53 % (28568)------------------------------
% 0.20/0.53 % (28554)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (28573)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.53 % (28558)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.54 % (28566)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54 % (28572)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.20/0.54 % (28572)Refutation not found, incomplete strategy% (28572)------------------------------
% 0.20/0.54 % (28572)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (28572)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (28572)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.54
% 0.20/0.54 % (28572)Memory used [KB]: 5884
% 0.20/0.54 % (28572)Time elapsed: 0.137 s
% 0.20/0.54 % (28572)Instructions burned: 2 (million)
% 0.20/0.54 % (28572)------------------------------
% 0.20/0.54 % (28572)------------------------------
% 0.20/0.54 % (28563)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.20/0.54 % (28553)First to succeed.
% 0.20/0.54 % (28563)Refutation not found, incomplete strategy% (28563)------------------------------
% 0.20/0.54 % (28563)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (28563)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (28563)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.54
% 0.20/0.54 % (28563)Memory used [KB]: 5884
% 0.20/0.54 % (28563)Time elapsed: 0.135 s
% 0.20/0.54 % (28563)Instructions burned: 2 (million)
% 0.20/0.54 % (28563)------------------------------
% 0.20/0.54 % (28563)------------------------------
% 0.20/0.54 % (28553)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (28553)------------------------------
% 0.20/0.54 % (28553)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (28553)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (28553)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (28553)Memory used [KB]: 6012
% 0.20/0.54 % (28553)Time elapsed: 0.130 s
% 0.20/0.54 % (28553)Instructions burned: 6 (million)
% 0.20/0.54 % (28553)------------------------------
% 0.20/0.54 % (28553)------------------------------
% 0.20/0.54 % (28547)Success in time 0.183 s
%------------------------------------------------------------------------------