TSTP Solution File: SET941+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET941+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 : n007.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:48 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 3 unt; 0 def)
% Number of atoms : 158 ( 10 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 187 ( 67 ~; 64 |; 38 &)
% ( 7 <=>; 11 =>; 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 106 ( 84 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(resolution,[],[f78,f42]) ).
fof(f42,plain,
~ subset(union(sK4),sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( ~ subset(union(sK4),sK3)
& ! [X2] :
( subset(X2,sK3)
| ~ in(X2,sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f23,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( ~ subset(union(X1),X0)
& ! [X2] :
( subset(X2,X0)
| ~ in(X2,X1) ) )
=> ( ~ subset(union(sK4),sK3)
& ! [X2] :
( subset(X2,sK3)
| ~ in(X2,sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( ~ subset(union(X1),X0)
& ! [X2] :
( subset(X2,X0)
| ~ in(X2,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
? [X1,X0] :
( ~ subset(union(X0),X1)
& ! [X2] :
( subset(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_zfmisc_1) ).
fof(f78,plain,
subset(union(sK4),sK3),
inference(duplicate_literal_removal,[],[f76]) ).
fof(f76,plain,
( subset(union(sK4),sK3)
| subset(union(sK4),sK3) ),
inference(resolution,[],[f69,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( in(sK5(X0,X1),X0)
& ~ in(sK5(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) )
=> ( in(sK5(X0,X1),X0)
& ~ in(sK5(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) ) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[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(f69,plain,
! [X0] :
( in(sK5(union(sK4),X0),sK3)
| subset(union(sK4),X0) ),
inference(resolution,[],[f68,f44]) ).
fof(f44,plain,
! [X0,X1] :
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f68,plain,
! [X0] :
( ~ in(X0,union(sK4))
| in(X0,sK3) ),
inference(duplicate_literal_removal,[],[f65]) ).
fof(f65,plain,
! [X0] :
( ~ in(X0,union(sK4))
| ~ in(X0,union(sK4))
| in(X0,sK3) ),
inference(resolution,[],[f64,f50]) ).
fof(f50,plain,
! [X2,X1] :
( in(X2,sK0(X1,X2))
| ~ in(X2,union(X1)) ),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( in(X2,sK0(X1,X2))
| ~ in(X2,X0)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,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])],[f17,f20,f19,f18]) ).
fof(f18,plain,
! [X1,X2] :
( ? [X3] :
( in(X3,X1)
& in(X2,X3) )
=> ( in(sK0(X1,X2),X1)
& in(X2,sK0(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,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(f20,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(f17,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,[],[f16]) ).
fof(f16,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,[],[f11]) ).
fof(f11,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] :
( union(X0) = X1
<=> ! [X2] :
( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
<=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f64,plain,
! [X0,X1] :
( ~ in(X1,sK0(sK4,X0))
| in(X1,sK3)
| ~ in(X0,union(sK4)) ),
inference(resolution,[],[f60,f45]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f60,plain,
! [X0] :
( subset(sK0(sK4,X0),sK3)
| ~ in(X0,union(sK4)) ),
inference(resolution,[],[f49,f41]) ).
fof(f41,plain,
! [X2] :
( ~ in(X2,sK4)
| subset(X2,sK3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X2,X1] :
( in(sK0(X1,X2),X1)
| ~ in(X2,union(X1)) ),
inference(equality_resolution,[],[f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( in(sK0(X1,X2),X1)
| ~ in(X2,X0)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET941+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.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:16:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (7287)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.50 % (7286)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.21/0.51 % (7308)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.21/0.51 % (7308)First to succeed.
% 0.21/0.51 % (7310)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.21/0.51 % (7309)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.21/0.51 % (7287)Instruction limit reached!
% 0.21/0.51 % (7287)------------------------------
% 0.21/0.51 % (7287)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (7287)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (7287)Termination reason: Unknown
% 0.21/0.51 % (7287)Termination phase: Saturation
% 0.21/0.51
% 0.21/0.51 % (7287)Memory used [KB]: 6140
% 0.21/0.51 % (7287)Time elapsed: 0.079 s
% 0.21/0.51 % (7287)Instructions burned: 14 (million)
% 0.21/0.51 % (7287)------------------------------
% 0.21/0.51 % (7287)------------------------------
% 0.21/0.52 % (7286)Also succeeded, but the first one will report.
% 0.21/0.52 % (7308)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (7308)------------------------------
% 0.21/0.52 % (7308)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (7308)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (7308)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (7308)Memory used [KB]: 5884
% 0.21/0.52 % (7308)Time elapsed: 0.109 s
% 0.21/0.52 % (7308)Instructions burned: 2 (million)
% 0.21/0.52 % (7308)------------------------------
% 0.21/0.52 % (7308)------------------------------
% 0.21/0.52 % (7285)Success in time 0.162 s
%------------------------------------------------------------------------------