TSTP Solution File: SET148+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET148+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 : n014.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:19:32 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 46 ~; 35 |; 15 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 61 ( 56 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f55,plain,
$false,
inference(subsumption_resolution,[],[f54,f47]) ).
fof(f47,plain,
member(sK0(sK1,intersection(sK1,sK1)),sK1),
inference(subsumption_resolution,[],[f46,f41]) ).
fof(f41,plain,
( ~ member(sK0(intersection(sK1,sK1),sK1),sK1)
| member(sK0(sK1,intersection(sK1,sK1)),sK1) ),
inference(resolution,[],[f40,f35]) ).
fof(f35,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) )
| subset(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
=> ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) )
| subset(X1,X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
=> subset(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X1)
=> member(X2,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f40,plain,
( ~ subset(sK1,intersection(sK1,sK1))
| ~ member(sK0(intersection(sK1,sK1),sK1),sK1) ),
inference(resolution,[],[f38,f34]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f38,plain,
( ~ subset(intersection(sK1,sK1),sK1)
| ~ subset(sK1,intersection(sK1,sK1)) ),
inference(resolution,[],[f37,f36]) ).
fof(f36,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| equal_set(X1,X0)
| ~ subset(X0,X1) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| equal_set(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f37,plain,
~ equal_set(intersection(sK1,sK1),sK1),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
~ equal_set(intersection(sK1,sK1),sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f20,f29]) ).
fof(f29,plain,
( ? [X0] : ~ equal_set(intersection(X0,X0),X0)
=> ~ equal_set(intersection(sK1,sK1),sK1) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0] : ~ equal_set(intersection(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,X0),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI13) ).
fof(f46,plain,
( member(sK0(intersection(sK1,sK1),sK1),sK1)
| member(sK0(sK1,intersection(sK1,sK1)),sK1) ),
inference(resolution,[],[f43,f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X1,intersection(X0,X2))
| member(X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X0,X2)) )
& ( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X2,X1,X0] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X2,X0)) )
& ( member(X1,intersection(X2,X0))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X2,X1,X0] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X2,X0)) )
& ( member(X1,intersection(X2,X0))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X2,X1,X0] :
( ( member(X1,X2)
& member(X1,X0) )
<=> member(X1,intersection(X2,X0)) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X2,X0] :
( ( member(X2,X0)
& member(X2,X1) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f43,plain,
( member(sK0(intersection(sK1,sK1),sK1),intersection(sK1,sK1))
| member(sK0(sK1,intersection(sK1,sK1)),sK1) ),
inference(resolution,[],[f39,f35]) ).
fof(f39,plain,
( ~ subset(sK1,intersection(sK1,sK1))
| member(sK0(intersection(sK1,sK1),sK1),intersection(sK1,sK1)) ),
inference(resolution,[],[f38,f35]) ).
fof(f54,plain,
~ member(sK0(sK1,intersection(sK1,sK1)),sK1),
inference(duplicate_literal_removal,[],[f53]) ).
fof(f53,plain,
( ~ member(sK0(sK1,intersection(sK1,sK1)),sK1)
| ~ member(sK0(sK1,intersection(sK1,sK1)),sK1) ),
inference(resolution,[],[f51,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
~ member(sK0(sK1,intersection(sK1,sK1)),intersection(sK1,sK1)),
inference(subsumption_resolution,[],[f50,f42]) ).
fof(f42,plain,
( ~ member(sK0(intersection(sK1,sK1),sK1),sK1)
| ~ member(sK0(sK1,intersection(sK1,sK1)),intersection(sK1,sK1)) ),
inference(resolution,[],[f40,f34]) ).
fof(f50,plain,
( member(sK0(intersection(sK1,sK1),sK1),sK1)
| ~ member(sK0(sK1,intersection(sK1,sK1)),intersection(sK1,sK1)) ),
inference(resolution,[],[f44,f32]) ).
fof(f44,plain,
( member(sK0(intersection(sK1,sK1),sK1),intersection(sK1,sK1))
| ~ member(sK0(sK1,intersection(sK1,sK1)),intersection(sK1,sK1)) ),
inference(resolution,[],[f39,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.14 % 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.35 % Computer : n014.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:23:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52 % (23149)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (23135)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 % (23136)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 % (23153)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.53 % (23159)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 % (23140)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.53 % (23144)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.53 % (23140)First to succeed.
% 0.20/0.53 % (23144)Refutation not found, incomplete strategy% (23144)------------------------------
% 0.20/0.53 % (23144)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (23140)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (23140)------------------------------
% 0.20/0.53 % (23140)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (23140)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (23140)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (23140)Memory used [KB]: 1407
% 0.20/0.53 % (23140)Time elapsed: 0.128 s
% 0.20/0.53 % (23140)Instructions burned: 2 (million)
% 0.20/0.53 % (23140)------------------------------
% 0.20/0.53 % (23140)------------------------------
% 0.20/0.53 % (23134)Success in time 0.173 s
%------------------------------------------------------------------------------