TSTP Solution File: SEU128+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU128+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 : n010.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:46 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 157 ( 13 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 184 ( 65 ~; 57 |; 49 &)
% ( 6 <=>; 7 =>; 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 90 ( 71 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f213,plain,
$false,
inference(subsumption_resolution,[],[f201,f85]) ).
fof(f85,plain,
~ in(sK0(set_intersection2(sK1,sK2),sK3),set_intersection2(sK1,sK2)),
inference(unit_resulting_resolution,[],[f68,f51]) ).
fof(f51,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ in(sK0(X0,X1),X0)
& in(sK0(X0,X1),X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) )
=> ( ~ in(sK0(X0,X1),X0)
& in(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f68,plain,
~ subset(sK3,set_intersection2(sK1,sK2)),
inference(forward_demodulation,[],[f55,f44]) ).
fof(f44,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f55,plain,
~ subset(sK3,set_intersection2(sK2,sK1)),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
( ~ subset(sK3,set_intersection2(sK2,sK1))
& subset(sK3,sK1)
& subset(sK3,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f35,f36]) ).
fof(f36,plain,
( ? [X0,X1,X2] :
( ~ subset(X2,set_intersection2(X1,X0))
& subset(X2,X0)
& subset(X2,X1) )
=> ( ~ subset(sK3,set_intersection2(sK2,sK1))
& subset(sK3,sK1)
& subset(sK3,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
? [X0,X1,X2] :
( ~ subset(X2,set_intersection2(X1,X0))
& subset(X2,X0)
& subset(X2,X1) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
? [X2,X0,X1] :
( ~ subset(X1,set_intersection2(X0,X2))
& subset(X1,X2)
& subset(X1,X0) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
? [X2,X1,X0] :
( ~ subset(X1,set_intersection2(X0,X2))
& subset(X1,X0)
& subset(X1,X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
~ ! [X2,X1,X0] :
( ( subset(X1,X0)
& subset(X1,X2) )
=> subset(X1,set_intersection2(X0,X2)) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X1,X0,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X1,X0,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f201,plain,
in(sK0(set_intersection2(sK1,sK2),sK3),set_intersection2(sK1,sK2)),
inference(unit_resulting_resolution,[],[f103,f104,f65]) ).
fof(f65,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X1,X0))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0)
| set_intersection2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f41,f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X0) )
| in(X4,X2) ) )
=> ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X1,X0) != X2 )
& ( set_intersection2(X1,X0) = X2
| ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X0) )
| in(X4,X2) ) ) ) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X2) )
| in(X3,X1) ) ) ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X2)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X2) )
| in(X3,X1) ) ) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X1)
<=> ( in(X3,X0)
& in(X3,X2) ) )
<=> set_intersection2(X0,X2) = X1 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f104,plain,
in(sK0(set_intersection2(sK1,sK2),sK3),sK1),
inference(unit_resulting_resolution,[],[f80,f54,f49]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ subset(X1,X0)
| in(X3,X0)
| ~ in(X3,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f54,plain,
subset(sK3,sK1),
inference(cnf_transformation,[],[f37]) ).
fof(f80,plain,
in(sK0(set_intersection2(sK1,sK2),sK3),sK3),
inference(unit_resulting_resolution,[],[f68,f50]) ).
fof(f50,plain,
! [X0,X1] :
( in(sK0(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f103,plain,
in(sK0(set_intersection2(sK1,sK2),sK3),sK2),
inference(unit_resulting_resolution,[],[f80,f53,f49]) ).
fof(f53,plain,
subset(sK3,sK2),
inference(cnf_transformation,[],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU128+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 : n010.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:33:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (6580)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.51 % (6591)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.52 % (6572)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 % (6580)First to succeed.
% 0.20/0.52 % (6583)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (6575)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52 % (6567)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 % (6588)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53 % (6569)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.53 % (6580)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 % (6580)------------------------------
% 0.20/0.53 % (6580)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (6580)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (6580)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (6580)Memory used [KB]: 6012
% 0.20/0.53 % (6580)Time elapsed: 0.120 s
% 0.20/0.53 % (6580)Instructions burned: 5 (million)
% 0.20/0.53 % (6580)------------------------------
% 0.20/0.53 % (6580)------------------------------
% 0.20/0.53 % (6566)Success in time 0.178 s
%------------------------------------------------------------------------------