TSTP Solution File: SET629+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET629+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:40 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 12 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 132 ( 55 ~; 43 |; 24 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 89 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f233,plain,
$false,
inference(resolution,[],[f229,f96]) ).
fof(f96,plain,
intersect(sK0,difference(sK1,sK0)),
inference(resolution,[],[f93,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ intersect(X1,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ~ intersect(X1,X0)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( intersect(X1,X0)
=> intersect(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( intersect(X0,X1)
=> intersect(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).
fof(f93,plain,
intersect(difference(sK1,sK0),sK0),
inference(resolution,[],[f91,f43]) ).
fof(f43,plain,
intersect(difference(sK1,sK0),intersection(sK1,sK0)),
inference(resolution,[],[f41,f35]) ).
fof(f41,plain,
intersect(intersection(sK1,sK0),difference(sK1,sK0)),
inference(resolution,[],[f37,f31]) ).
fof(f31,plain,
~ disjoint(intersection(sK1,sK0),difference(sK1,sK0)),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
~ disjoint(intersection(sK1,sK0),difference(sK1,sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] : ~ disjoint(intersection(X1,X0),difference(X1,X0))
=> ~ disjoint(intersection(sK1,sK0),difference(sK1,sK0)) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] : ~ disjoint(intersection(X1,X0),difference(X1,X0)),
inference(rectify,[],[f13]) ).
fof(f13,plain,
? [X1,X0] : ~ disjoint(intersection(X0,X1),difference(X0,X1)),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X1,X0] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X1,X0] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).
fof(f37,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| intersect(X0,X1) )
& ( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f91,plain,
! [X2,X0,X1] :
( ~ intersect(X0,intersection(X1,X2))
| intersect(X0,X2) ),
inference(duplicate_literal_removal,[],[f83]) ).
fof(f83,plain,
! [X2,X0,X1] :
( intersect(X0,X2)
| ~ intersect(X0,intersection(X1,X2))
| ~ intersect(X0,intersection(X1,X2)) ),
inference(resolution,[],[f45,f54]) ).
fof(f54,plain,
! [X3,X4,X5] :
( ~ member(sK2(X3,X4),X5)
| intersect(X4,X5)
| ~ intersect(X4,X3) ),
inference(resolution,[],[f34,f33]) ).
fof(f33,plain,
! [X0,X1] :
( member(sK2(X0,X1),X1)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) )
| ~ intersect(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X1,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( intersect(X1,X0)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X1,X0) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( intersect(X1,X0)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X2,X0,X1] :
( member(sK2(intersection(X1,X2),X0),X2)
| ~ intersect(X0,intersection(X1,X2)) ),
inference(resolution,[],[f32,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X2,X0))
| member(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,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,[],[f16]) ).
fof(f16,plain,
! [X2,X1,X0] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) )
& ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X2,X1,X0] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) )
& ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X1,X0] :
( ( member(X1,X2)
& member(X1,X0) )
<=> member(X1,intersection(X0,X2)) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X2,X1] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f32,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| ~ intersect(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f229,plain,
! [X2,X3] : ~ intersect(X2,difference(X3,X2)),
inference(duplicate_literal_removal,[],[f222]) ).
fof(f222,plain,
! [X2,X3] :
( ~ intersect(X2,difference(X3,X2))
| ~ intersect(X2,difference(X3,X2)) ),
inference(resolution,[],[f51,f33]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ member(sK2(difference(X0,X1),X2),X1)
| ~ intersect(X2,difference(X0,X1)) ),
inference(resolution,[],[f40,f32]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) )
& ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) )
& ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( ~ member(X2,X1)
& member(X2,X0) )
<=> member(X2,difference(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET629+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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:51:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 % (19336)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.47 % (19336)First to succeed.
% 0.20/0.47 % (19359)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.48 % (19351)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.48 % (19336)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (19336)------------------------------
% 0.20/0.48 % (19336)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (19336)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (19336)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (19336)Memory used [KB]: 6012
% 0.20/0.48 % (19336)Time elapsed: 0.087 s
% 0.20/0.48 % (19336)Instructions burned: 7 (million)
% 0.20/0.48 % (19336)------------------------------
% 0.20/0.48 % (19336)------------------------------
% 0.20/0.48 % (19331)Success in time 0.138 s
%------------------------------------------------------------------------------