TSTP Solution File: SEU140+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU140+2 : TPTP v8.1.0. Released v3.3.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 : n009.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:26:51 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 124 ( 47 ~; 27 |; 41 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 55 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f398,plain,
$false,
inference(subsumption_resolution,[],[f397,f369]) ).
fof(f369,plain,
in(sK6(sK10,sK9),sK8),
inference(resolution,[],[f368,f324]) ).
fof(f324,plain,
! [X0] :
( ~ in(X0,sK9)
| in(X0,sK8) ),
inference(resolution,[],[f229,f220]) ).
fof(f220,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| ~ in(X2,X1)
| in(X2,X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ in(sK7(X0,X1),X0)
& in(sK7(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f144,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) )
=> ( ~ in(sK7(X0,X1),X0)
& in(sK7(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) ) ) ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
! [X1,X0] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f229,plain,
subset(sK9,sK8),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
( subset(sK9,sK8)
& disjoint(sK8,sK10)
& ~ disjoint(sK9,sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f150,f151]) ).
fof(f151,plain,
( ? [X0,X1,X2] :
( subset(X1,X0)
& disjoint(X0,X2)
& ~ disjoint(X1,X2) )
=> ( subset(sK9,sK8)
& disjoint(sK8,sK10)
& ~ disjoint(sK9,sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
? [X0,X1,X2] :
( subset(X1,X0)
& disjoint(X0,X2)
& ~ disjoint(X1,X2) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
? [X0,X2,X1] :
( subset(X2,X0)
& disjoint(X0,X1)
& ~ disjoint(X2,X1) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
? [X1,X0,X2] :
( ~ disjoint(X2,X1)
& disjoint(X0,X1)
& subset(X2,X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
~ ! [X1,X0,X2] :
( ( disjoint(X0,X1)
& subset(X2,X0) )
=> disjoint(X2,X1) ),
inference(rectify,[],[f52]) ).
fof(f52,negated_conjecture,
~ ! [X1,X2,X0] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[],[f51]) ).
fof(f51,conjecture,
! [X1,X2,X0] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f368,plain,
in(sK6(sK10,sK9),sK9),
inference(resolution,[],[f208,f227]) ).
fof(f227,plain,
~ disjoint(sK9,sK10),
inference(cnf_transformation,[],[f152]) ).
fof(f208,plain,
! [X0,X1] :
( disjoint(X1,X0)
| in(sK6(X0,X1),X1) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| ~ in(X2,X1) )
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| ( in(sK6(X0,X1),X1)
& in(sK6(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f136,f137]) ).
fof(f137,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
=> ( in(sK6(X0,X1),X1)
& in(sK6(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| ~ in(X2,X1) )
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| ? [X3] :
( in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f83]) ).
fof(f83,plain,
! [X1,X0] :
( ( ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) )
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ ( ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) )
& ~ disjoint(X0,X1) )
& ~ ( disjoint(X0,X1)
& ? [X3] :
( in(X3,X0)
& in(X3,X1) ) ) ),
inference(rectify,[],[f43]) ).
fof(f43,axiom,
! [X0,X1] :
( ~ ( ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) )
& ~ disjoint(X0,X1) )
& ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f397,plain,
~ in(sK6(sK10,sK9),sK8),
inference(resolution,[],[f393,f364]) ).
fof(f364,plain,
in(sK6(sK10,sK9),sK10),
inference(resolution,[],[f207,f227]) ).
fof(f207,plain,
! [X0,X1] :
( disjoint(X1,X0)
| in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f138]) ).
fof(f393,plain,
! [X0] :
( ~ in(X0,sK10)
| ~ in(X0,sK8) ),
inference(resolution,[],[f209,f228]) ).
fof(f228,plain,
disjoint(sK8,sK10),
inference(cnf_transformation,[],[f152]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ disjoint(X1,X0)
| ~ in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU140+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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 : n009.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 14:41:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (1795)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.50 % (1803)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.19/0.50 % (1783)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.19/0.50 % (1795)First to succeed.
% 0.19/0.50 % (1793)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.19/0.51 % (1795)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (1795)------------------------------
% 0.19/0.51 % (1795)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (1795)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (1795)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (1795)Memory used [KB]: 1663
% 0.19/0.51 % (1795)Time elapsed: 0.093 s
% 0.19/0.51 % (1795)Instructions burned: 7 (million)
% 0.19/0.51 % (1795)------------------------------
% 0.19/0.51 % (1795)------------------------------
% 0.19/0.51 % (1781)Success in time 0.159 s
%------------------------------------------------------------------------------