TSTP Solution File: SEU143+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU143+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 : n015.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:52 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 78 ( 44 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 89 ( 35 ~; 32 |; 14 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f31]) ).
fof(f31,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f24]) ).
fof(f24,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ( empty_set = X0
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).
fof(f16,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f36,plain,
in(sK1,empty_set),
inference(superposition,[],[f33,f26]) ).
fof(f26,plain,
empty_set = singleton(sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
empty_set = singleton(sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f18]) ).
fof(f18,plain,
( ? [X0] : singleton(X0) = empty_set
=> empty_set = singleton(sK1) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0] : singleton(X0) = empty_set,
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0] : singleton(X0) != empty_set,
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f33,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1,X0] :
( ( singleton(X1) = X0
| ? [X2] :
( ( X1 != X2
| ~ in(X2,X0) )
& ( X1 = X2
| in(X2,X0) ) ) )
& ( ! [X2] :
( ( in(X2,X0)
| X1 != X2 )
& ( X1 = X2
| ~ in(X2,X0) ) )
| singleton(X1) != X0 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X1,X0] :
( singleton(X1) = X0
<=> ! [X2] :
( in(X2,X0)
<=> X1 = X2 ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
<=> X0 = X2 )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:55:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (29386)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51 % (29382)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.21/0.51 % (29375)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.21/0.51 % (29384)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.21/0.51 % (29375)First to succeed.
% 0.21/0.51 % (29378)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.21/0.51 % (29390)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.51 % (29375)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (29375)------------------------------
% 0.21/0.51 % (29375)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (29375)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (29375)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (29375)Memory used [KB]: 5884
% 0.21/0.51 % (29375)Time elapsed: 0.095 s
% 0.21/0.51 % (29375)Instructions burned: 2 (million)
% 0.21/0.51 % (29375)------------------------------
% 0.21/0.51 % (29375)------------------------------
% 0.21/0.51 % (29371)Success in time 0.153 s
%------------------------------------------------------------------------------