TSTP Solution File: SEU152+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU152+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 : n027.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:55 EDT 2022
% Result : Theorem 0.17s 0.49s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 43 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 7 |; 6 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f27]) ).
fof(f27,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( sK1 != set_union2(singleton(sK0),sK1)
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) )
=> ( sK1 != set_union2(singleton(sK0),sK1)
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( set_union2(singleton(X0),X1) != X1
& in(X0,X1) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
? [X1,X0] :
( set_union2(singleton(X1),X0) != X0
& in(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X1,X0] :
( in(X1,X0)
=> set_union2(singleton(X1),X0) = X0 ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X1,X0] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X1,X0] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f58,plain,
~ in(sK0,sK1),
inference(resolution,[],[f48,f33]) ).
fof(f33,plain,
! [X0,X1] :
( subset(singleton(X1),X0)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(singleton(X1),X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ subset(singleton(X1),X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( subset(singleton(X1),X0)
<=> in(X1,X0) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( in(X0,X1)
<=> subset(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f48,plain,
~ subset(singleton(sK0),sK1),
inference(trivial_inequality_removal,[],[f44]) ).
fof(f44,plain,
( ~ subset(singleton(sK0),sK1)
| sK1 != sK1 ),
inference(superposition,[],[f28,f30]) ).
fof(f30,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( set_union2(X1,X0) = X0
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( subset(X1,X0)
=> set_union2(X1,X0) = X0 ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X0] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f28,plain,
sK1 != set_union2(singleton(sK0),sK1),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 15:23:16 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.47 % (29586)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.17/0.48 % (29586)First to succeed.
% 0.17/0.49 % (29602)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.17/0.49 % (29586)Refutation found. Thanks to Tanya!
% 0.17/0.49 % SZS status Theorem for theBenchmark
% 0.17/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (29586)------------------------------
% 0.17/0.49 % (29586)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (29586)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (29586)Termination reason: Refutation
% 0.17/0.49
% 0.17/0.49 % (29586)Memory used [KB]: 5884
% 0.17/0.49 % (29586)Time elapsed: 0.103 s
% 0.17/0.49 % (29586)Instructions burned: 2 (million)
% 0.17/0.49 % (29586)------------------------------
% 0.17/0.49 % (29586)------------------------------
% 0.17/0.49 % (29579)Success in time 0.165 s
%------------------------------------------------------------------------------