TSTP Solution File: SEU155+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU155+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_sat --cores 0 -t %d %s
% Computer : n013.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:32:12 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 133 ( 9 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 156 ( 54 ~; 50 |; 38 &)
% ( 6 <=>; 8 =>; 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 : 85 ( 63 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(subsumption_resolution,[],[f84,f39]) ).
fof(f39,plain,
~ subset(sK5,union(sK4)),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( ~ subset(sK5,union(sK4))
& in(sK5,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f24,f25]) ).
fof(f25,plain,
( ? [X0,X1] :
( ~ subset(X1,union(X0))
& in(X1,X0) )
=> ( ~ subset(sK5,union(sK4))
& in(sK5,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
? [X0,X1] :
( ~ subset(X1,union(X0))
& in(X1,X0) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
? [X1,X0] :
( ~ subset(X0,union(X1))
& in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f84,plain,
subset(sK5,union(sK4)),
inference(duplicate_literal_removal,[],[f83]) ).
fof(f83,plain,
( subset(sK5,union(sK4))
| subset(sK5,union(sK4)) ),
inference(resolution,[],[f62,f34]) ).
fof(f34,plain,
! [X0,X1] :
( in(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f62,plain,
! [X3] :
( ~ in(sK3(X3,union(sK4)),sK5)
| subset(X3,union(sK4)) ),
inference(resolution,[],[f53,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ in(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f53,plain,
! [X9] :
( in(X9,union(sK4))
| ~ in(X9,sK5) ),
inference(resolution,[],[f40,f38]) ).
fof(f38,plain,
in(sK5,sK4),
inference(cnf_transformation,[],[f26]) ).
fof(f40,plain,
! [X2,X3,X1] :
( ~ in(X3,X1)
| ~ in(X2,X3)
| in(X2,union(X1)) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( in(X2,X0)
| ~ in(X2,X3)
| ~ in(X3,X1)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( ( in(X2,sK0(X1,X2))
& in(sK0(X1,X2),X1) )
| ~ in(X2,X0) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ( ( ! [X6] :
( ~ in(sK1(X0,X1),X6)
| ~ in(X6,X1) )
| ~ in(sK1(X0,X1),X0) )
& ( ( in(sK1(X0,X1),sK2(X0,X1))
& in(sK2(X0,X1),X1) )
| in(sK1(X0,X1),X0) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f18,f17,f16]) ).
fof(f16,plain,
! [X1,X2] :
( ? [X4] :
( in(X2,X4)
& in(X4,X1) )
=> ( in(X2,sK0(X1,X2))
& in(sK0(X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X5] :
( ( ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X1) )
| ~ in(X5,X0) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X1) )
| in(X5,X0) ) )
=> ( ( ! [X6] :
( ~ in(sK1(X0,X1),X6)
| ~ in(X6,X1) )
| ~ in(sK1(X0,X1),X0) )
& ( ? [X7] :
( in(sK1(X0,X1),X7)
& in(X7,X1) )
| in(sK1(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X7] :
( in(sK1(X0,X1),X7)
& in(X7,X1) )
=> ( in(sK1(X0,X1),sK2(X0,X1))
& in(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X1) )
| ~ in(X2,X0) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ? [X5] :
( ( ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X1) )
| ~ in(X5,X0) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X1) )
| in(X5,X0) ) ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X1) )
| ~ in(X2,X0) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) )
| ~ in(X2,X0) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X1) )
| in(X2,X0) ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X1) ) )
<=> union(X1) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) )
<=> union(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:38:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (29968)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 (2999ds/498Mi)
% 0.20/0.55 % (29953)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (29952)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (29960)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 (2999ds/68Mi)
% 0.20/0.55 % (29953)First to succeed.
% 0.20/0.55 % (29953)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (29953)------------------------------
% 0.20/0.55 % (29953)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (29953)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (29953)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (29953)Memory used [KB]: 5373
% 0.20/0.55 % (29953)Time elapsed: 0.123 s
% 0.20/0.55 % (29953)Instructions burned: 3 (million)
% 0.20/0.55 % (29953)------------------------------
% 0.20/0.55 % (29953)------------------------------
% 0.20/0.55 % (29945)Success in time 0.194 s
%------------------------------------------------------------------------------