TSTP Solution File: SET941+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n009.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:09 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 5 unt; 0 def)
% Number of atoms : 153 ( 9 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 184 ( 68 ~; 62 |; 36 &)
% ( 5 <=>; 13 =>; 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 : 102 ( 83 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,plain,
$false,
inference(subsumption_resolution,[],[f66,f54]) ).
fof(f54,plain,
~ in(sK6(union(sK1),sK0),sK0),
inference(resolution,[],[f46,f35]) ).
fof(f35,plain,
~ subset(union(sK1),sK0),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ~ subset(union(sK1),sK0)
& ! [X2] :
( subset(X2,sK0)
| ~ in(X2,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f17]) ).
fof(f17,plain,
( ? [X0,X1] :
( ~ subset(union(X1),X0)
& ! [X2] :
( subset(X2,X0)
| ~ in(X2,X1) ) )
=> ( ~ subset(union(sK1),sK0)
& ! [X2] :
( subset(X2,sK0)
| ~ in(X2,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1] :
( ~ subset(union(X1),X0)
& ! [X2] :
( subset(X2,X0)
| ~ in(X2,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
~ ! [X1,X0] :
( ! [X2] :
( in(X2,X1)
=> subset(X2,X0) )
=> subset(union(X1),X0) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t94_zfmisc_1) ).
fof(f46,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK6(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK6(X0,X1),X1)
& in(sK6(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f28,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK6(X0,X1),X1)
& in(sK6(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
=> in(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f66,plain,
in(sK6(union(sK1),sK0),sK0),
inference(resolution,[],[f65,f52]) ).
fof(f52,plain,
in(sK6(union(sK1),sK0),union(sK1)),
inference(resolution,[],[f45,f35]) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f65,plain,
! [X0] :
( ~ in(X0,union(sK1))
| in(X0,sK0) ),
inference(duplicate_literal_removal,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ~ in(X0,union(sK1))
| in(X0,sK0)
| ~ in(X0,union(sK1)) ),
inference(resolution,[],[f50,f60]) ).
fof(f60,plain,
! [X0,X1] :
( ~ in(sK4(X1,X0),sK1)
| in(X0,sK0)
| ~ in(X0,union(X1)) ),
inference(resolution,[],[f49,f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ in(X0,X1)
| in(X0,sK0)
| ~ in(X1,sK1) ),
inference(resolution,[],[f44,f34]) ).
fof(f34,plain,
! [X2] :
( subset(X2,sK0)
| ~ in(X2,sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X0,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(sK2(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK2(X0,X1),X1) )
& ( ( in(sK2(X0,X1),sK3(X0,X1))
& in(sK3(X0,X1),X0) )
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ( in(X5,sK4(X0,X5))
& in(sK4(X0,X5),X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f20,f23,f22,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(sK2(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK2(X0,X1),X1) )
& ( ? [X4] :
( in(sK2(X0,X1),X4)
& in(X4,X0) )
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X4] :
( in(sK2(X0,X1),X4)
& in(X4,X0) )
=> ( in(sK2(X0,X1),sK3(X0,X1))
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X5] :
( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
=> ( in(X5,sK4(X0,X5))
& in(sK4(X0,X5),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f50,plain,
! [X0,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET941+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 30 14:29:05 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.48 % (31851)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.18/0.49 % (31842)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.18/0.49 % (31851)First to succeed.
% 0.18/0.49 % (31834)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.49 % (31832)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.49 % (31828)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.18/0.49 % (31831)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.49 % (31835)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.18/0.49 % (31851)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (31851)------------------------------
% 0.18/0.49 % (31851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (31851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (31851)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (31851)Memory used [KB]: 895
% 0.18/0.49 % (31851)Time elapsed: 0.055 s
% 0.18/0.49 % (31851)Instructions burned: 2 (million)
% 0.18/0.49 % (31851)------------------------------
% 0.18/0.49 % (31851)------------------------------
% 0.18/0.49 % (31827)Success in time 0.158 s
%------------------------------------------------------------------------------