TSTP Solution File: SEU130+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU130+1 : 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 : n013.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:47 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 11 unt; 0 def)
% Number of atoms : 172 ( 28 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 205 ( 75 ~; 68 |; 46 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 96 ( 83 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(subsumption_resolution,[],[f89,f74]) ).
fof(f74,plain,
~ in(sK0(sK2,set_intersection2(sK2,sK3)),set_intersection2(sK2,sK3)),
inference(unit_resulting_resolution,[],[f72,f48]) ).
fof(f48,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) )
=> ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) ) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f72,plain,
~ subset(sK2,set_intersection2(sK2,sK3)),
inference(unit_resulting_resolution,[],[f60,f62,f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f62,plain,
sK2 != set_intersection2(sK2,sK3),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
( sK2 != set_intersection2(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f43,f44]) ).
fof(f44,plain,
( ? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) )
=> ( sK2 != set_intersection2(sK2,sK3)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X1,X0] :
( set_intersection2(X1,X0) != X1
& subset(X1,X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X0,X1] :
( subset(X1,X0)
=> set_intersection2(X1,X0) = X1 ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X1,X0] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f60,plain,
! [X0,X1] : subset(set_intersection2(X1,X0),X1),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1] : subset(set_intersection2(X1,X0),X1),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X1,X0] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f89,plain,
in(sK0(sK2,set_intersection2(sK2,sK3)),set_intersection2(sK2,sK3)),
inference(unit_resulting_resolution,[],[f75,f79,f69]) ).
fof(f69,plain,
! [X2,X3,X1] :
( in(X3,set_intersection2(X2,X1))
| ~ in(X3,X1)
| ~ in(X3,X2) ),
inference(equality_resolution,[],[f59]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_intersection2(X2,X1) != X0 )
& ( set_intersection2(X2,X1) = X0
| ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2)
| ~ in(sK1(X0,X1,X2),X0) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X2) )
| in(sK1(X0,X1,X2),X0) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f39,f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X2) )
| in(X4,X0) ) )
=> ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2)
| ~ in(sK1(X0,X1,X2),X0) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X2) )
| in(sK1(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) ) )
| set_intersection2(X2,X1) != X0 )
& ( set_intersection2(X2,X1) = X0
| ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X2) )
| in(X4,X0) ) ) ) ),
inference(rectify,[],[f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) ) ),
inference(flattening,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) )
<=> set_intersection2(X1,X0) = X2 ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f79,plain,
in(sK0(sK2,set_intersection2(sK2,sK3)),sK3),
inference(unit_resulting_resolution,[],[f61,f75,f50]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f61,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f45]) ).
fof(f75,plain,
in(sK0(sK2,set_intersection2(sK2,sK3)),sK2),
inference(unit_resulting_resolution,[],[f72,f49]) ).
fof(f49,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU130+1 : 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 : n013.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:37:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (26498)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.51 % (26497)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 % (26518)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.52 % (26498)First to succeed.
% 0.20/0.52 % (26501)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.52 % (26497)Instruction limit reached!
% 0.20/0.52 % (26497)------------------------------
% 0.20/0.52 % (26497)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26498)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (26498)------------------------------
% 0.20/0.52 % (26498)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26498)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (26498)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (26498)Memory used [KB]: 5884
% 0.20/0.52 % (26498)Time elapsed: 0.116 s
% 0.20/0.52 % (26498)Instructions burned: 2 (million)
% 0.20/0.52 % (26498)------------------------------
% 0.20/0.52 % (26498)------------------------------
% 0.20/0.52 % (26492)Success in time 0.171 s
%------------------------------------------------------------------------------