TSTP Solution File: SEU133+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU133+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 : n012.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:48 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 123 ( 11 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 156 ( 59 ~; 53 |; 34 &)
% ( 6 <=>; 4 =>; 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 : 70 ( 59 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,plain,
$false,
inference(unit_resulting_resolution,[],[f68,f69,f64]) ).
fof(f64,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,set_difference(X1,X0)) ),
inference(equality_resolution,[],[f60]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_difference(X1,X0) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( set_difference(X1,X0) = X2
| ( ( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0) )
& ( in(sK5(X0,X1,X2),X2)
| ( in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X1)
& ~ in(X4,X0) )
| ~ in(X4,X2) )
& ( in(X4,X2)
| ~ in(X4,X1)
| in(X4,X0) ) )
| set_difference(X1,X0) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f41,f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X1)
| in(X3,X0) )
& ( in(X3,X2)
| ( in(X3,X1)
& ~ in(X3,X0) ) ) )
=> ( ( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0) )
& ( in(sK5(X0,X1,X2),X2)
| ( in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( set_difference(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X1)
| in(X3,X0) )
& ( in(X3,X2)
| ( in(X3,X1)
& ~ in(X3,X0) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X1)
& ~ in(X4,X0) )
| ~ in(X4,X2) )
& ( in(X4,X2)
| ~ in(X4,X1)
| in(X4,X0) ) )
| set_difference(X1,X0) != X2 ) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
! [X0,X2,X1] :
( ( set_difference(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& ~ in(X3,X0) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
& ~ in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| in(X3,X0) ) )
| set_difference(X2,X0) != X1 ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X2,X1] :
( ( set_difference(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& ~ in(X3,X0) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
& ~ in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| in(X3,X0) ) )
| set_difference(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X2,X1] :
( set_difference(X2,X0) = X1
<=> ! [X3] :
( ( in(X3,X2)
& ~ in(X3,X0) )
<=> in(X3,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] :
( ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) )
<=> set_difference(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f69,plain,
in(sK3(set_difference(sK1,sK2),sK1),set_difference(sK1,sK2)),
inference(resolution,[],[f50,f52]) ).
fof(f52,plain,
! [X0,X1] :
( in(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f50,plain,
~ subset(set_difference(sK1,sK2),sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
~ subset(set_difference(sK1,sK2),sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f25,f28]) ).
fof(f28,plain,
( ? [X0,X1] : ~ subset(set_difference(X0,X1),X0)
=> ~ subset(set_difference(sK1,sK2),sK1) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0,X1] : ~ subset(set_difference(X0,X1),X0),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X0] : subset(set_difference(X0,X1),X0),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X1,X0] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f68,plain,
~ in(sK3(set_difference(sK1,sK2),sK1),sK1),
inference(unit_resulting_resolution,[],[f50,f53]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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:40:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (7003)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.55 % (7004)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.55 % (7019)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.55 % (7004)First to succeed.
% 0.19/0.56 % (7004)Refutation found. Thanks to Tanya!
% 0.19/0.56 % SZS status Theorem for theBenchmark
% 0.19/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.56 % (7004)------------------------------
% 0.19/0.56 % (7004)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (7004)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (7004)Termination reason: Refutation
% 0.19/0.56
% 0.19/0.56 % (7004)Memory used [KB]: 5884
% 0.19/0.56 % (7004)Time elapsed: 0.126 s
% 0.19/0.56 % (7004)Instructions burned: 3 (million)
% 0.19/0.56 % (7004)------------------------------
% 0.19/0.56 % (7004)------------------------------
% 0.19/0.56 % (6996)Success in time 0.209 s
%------------------------------------------------------------------------------