TSTP Solution File: SET867+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET867+1 : TPTP v8.1.0. Released v3.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 : n023.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:22:38 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 103 ( 23 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 122 ( 44 ~; 41 |; 28 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 64 ( 48 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(subsumption_resolution,[],[f50,f38]) ).
fof(f38,plain,
empty_set != union(empty_set),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
empty_set != union(empty_set),
inference(flattening,[],[f8]) ).
fof(f8,negated_conjecture,
empty_set != union(empty_set),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
empty_set = union(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_zfmisc_1) ).
fof(f50,plain,
empty_set = union(empty_set),
inference(resolution,[],[f46,f33]) ).
fof(f33,plain,
! [X0] :
( in(sK3(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| in(sK3(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f20,f21]) ).
fof(f21,plain,
! [X0] :
( ? [X2] : in(X2,X0)
=> in(sK3(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X2] : in(X2,X0) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X1] : in(X1,X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] :
( ! [X1] : ~ in(X1,X0)
<=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f46,plain,
! [X0] : ~ in(X0,union(empty_set)),
inference(resolution,[],[f40,f43]) ).
fof(f43,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
! [X2,X1] :
( in(sK0(X1,X2),X1)
| ~ in(X2,union(X1)) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( in(sK0(X1,X2),X1)
| ~ in(X2,X0)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( ( ( in(sK0(X1,X2),X1)
& in(X2,sK0(X1,X2)) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ! [X4] :
( ~ in(X4,X1)
| ~ in(X2,X4) ) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ( ( ~ in(sK1(X0,X1),X0)
| ! [X6] :
( ~ in(X6,X1)
| ~ in(sK1(X0,X1),X6) ) )
& ( in(sK1(X0,X1),X0)
| ( in(sK2(X0,X1),X1)
& in(sK1(X0,X1),sK2(X0,X1)) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f17,f16,f15]) ).
fof(f15,plain,
! [X1,X2] :
( ? [X3] :
( in(X3,X1)
& in(X2,X3) )
=> ( in(sK0(X1,X2),X1)
& in(X2,sK0(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X5] :
( ( ~ in(X5,X0)
| ! [X6] :
( ~ in(X6,X1)
| ~ in(X5,X6) ) )
& ( in(X5,X0)
| ? [X7] :
( in(X7,X1)
& in(X5,X7) ) ) )
=> ( ( ~ in(sK1(X0,X1),X0)
| ! [X6] :
( ~ in(X6,X1)
| ~ in(sK1(X0,X1),X6) ) )
& ( in(sK1(X0,X1),X0)
| ? [X7] :
( in(X7,X1)
& in(sK1(X0,X1),X7) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X7] :
( in(X7,X1)
& in(sK1(X0,X1),X7) )
=> ( in(sK2(X0,X1),X1)
& in(sK1(X0,X1),sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0,X1] :
( ( ! [X2] :
( ( ? [X3] :
( in(X3,X1)
& in(X2,X3) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ! [X4] :
( ~ in(X4,X1)
| ~ in(X2,X4) ) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ? [X5] :
( ( ~ in(X5,X0)
| ! [X6] :
( ~ in(X6,X1)
| ~ in(X5,X6) ) )
& ( in(X5,X0)
| ? [X7] :
( in(X7,X1)
& in(X5,X7) ) ) ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( ! [X2] :
( ( ? [X3] :
( in(X3,X1)
& in(X2,X3) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X2,X3) ) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X2,X3) ) )
& ( in(X2,X0)
| ? [X3] :
( in(X3,X1)
& in(X2,X3) ) ) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ! [X2] :
( ? [X3] :
( in(X3,X1)
& in(X2,X3) )
<=> in(X2,X0) )
<=> union(X1) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( ! [X2] :
( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
<=> in(X2,X1) )
<=> union(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET867+1 : TPTP v8.1.0. Released v3.2.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 : n023.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:48:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (31955)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.19/0.51 % (31976)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51 % (31968)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (31958)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.19/0.51 % (31960)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.51 % (31958)Refutation not found, incomplete strategy% (31958)------------------------------
% 0.19/0.51 % (31958)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (31958)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (31958)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (31958)Memory used [KB]: 1407
% 0.19/0.51 % (31958)Time elapsed: 0.102 s
% 0.19/0.51 % (31958)Instructions burned: 2 (million)
% 0.19/0.51 % (31958)------------------------------
% 0.19/0.51 % (31958)------------------------------
% 0.19/0.51 % (31968)First to succeed.
% 0.19/0.51 % (31955)Refutation not found, incomplete strategy% (31955)------------------------------
% 0.19/0.51 % (31955)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (31959)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.51 % (31953)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.19/0.51 % (31955)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (31955)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (31955)Memory used [KB]: 5884
% 0.19/0.51 % (31955)Time elapsed: 0.111 s
% 0.19/0.51 % (31955)Instructions burned: 1 (million)
% 0.19/0.51 % (31955)------------------------------
% 0.19/0.51 % (31955)------------------------------
% 0.19/0.51 % (31961)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.19/0.51 % (31960)Also succeeded, but the first one will report.
% 0.19/0.51 % (31968)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 % (31968)------------------------------
% 0.19/0.51 % (31968)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (31968)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (31968)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (31968)Memory used [KB]: 5884
% 0.19/0.51 % (31968)Time elapsed: 0.065 s
% 0.19/0.51 % (31968)Instructions burned: 2 (million)
% 0.19/0.51 % (31968)------------------------------
% 0.19/0.51 % (31968)------------------------------
% 0.19/0.51 % (31952)Success in time 0.162 s
%------------------------------------------------------------------------------