TSTP Solution File: SEU124+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU124+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 : n021.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:01 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 129 ( 11 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 159 ( 60 ~; 55 |; 32 &)
% ( 7 <=>; 5 =>; 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 : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 77 ( 64 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f115,plain,
$false,
inference(subsumption_resolution,[],[f110,f100]) ).
fof(f100,plain,
in(sK1(set_union2(sK3,sK4),sK3),sK3),
inference(resolution,[],[f62,f73]) ).
fof(f73,plain,
~ subset(sK3,set_union2(sK3,sK4)),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
~ subset(sK3,set_union2(sK3,sK4)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f48,f49]) ).
fof(f49,plain,
( ? [X0,X1] : ~ subset(X0,set_union2(X0,X1))
=> ~ subset(sK3,set_union2(sK3,sK4)) ),
introduced(choice_axiom,[]) ).
fof(f48,plain,
? [X0,X1] : ~ subset(X0,set_union2(X0,X1)),
inference(rectify,[],[f34]) ).
fof(f34,plain,
? [X1,X0] : ~ subset(X1,set_union2(X1,X0)),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
~ ! [X1,X0] : subset(X1,set_union2(X1,X0)),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X1,X0] : subset(X0,set_union2(X0,X1)),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X1,X0] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f62,plain,
! [X0,X1] :
( subset(X1,X0)
| in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ in(sK1(X0,X1),X0)
& in(sK1(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f42,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) )
=> ( ~ in(sK1(X0,X1),X0)
& in(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) ) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f110,plain,
~ in(sK1(set_union2(sK3,sK4),sK3),sK3),
inference(resolution,[],[f79,f102]) ).
fof(f102,plain,
~ in(sK1(set_union2(sK3,sK4),sK3),set_union2(sK3,sK4)),
inference(resolution,[],[f63,f73]) ).
fof(f63,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f79,plain,
! [X3,X0,X1] :
( in(X3,set_union2(X1,X0))
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f60]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X1)
| set_union2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X1,X0) != X2 )
& ( set_union2(X1,X0) = X2
| ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ( ~ in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) )
& ( in(X4,X0)
| in(X4,X1)
| in(X4,X2) ) )
=> ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X1,X0) != X2 )
& ( set_union2(X1,X0) = X2
| ? [X4] :
( ( ( ~ in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) )
& ( in(X4,X0)
| in(X4,X1)
| in(X4,X2) ) ) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) ) )
| set_union2(X0,X2) != X1 )
& ( set_union2(X0,X2) = X1
| ? [X3] :
( ( ( ~ in(X3,X2)
& ~ in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X2)
| in(X3,X0)
| in(X3,X1) ) ) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) ) )
| set_union2(X0,X2) != X1 )
& ( set_union2(X0,X2) = X1
| ? [X3] :
( ( ( ~ in(X3,X2)
& ~ in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X2)
| in(X3,X0)
| in(X3,X1) ) ) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X1)
<=> ( in(X3,X2)
| in(X3,X0) ) )
<=> set_union2(X0,X2) = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X2,X1] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X1)
| in(X3,X0) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU124+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 14:36:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (25667)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.19/0.50 % (25659)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.19/0.51 % (25667)First to succeed.
% 0.19/0.51 % (25651)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.19/0.51 TRYING [1]
% 0.19/0.51 TRYING [2]
% 0.19/0.51 TRYING [3]
% 0.19/0.51 % (25667)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (25667)------------------------------
% 0.19/0.51 % (25667)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (25667)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (25667)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (25667)Memory used [KB]: 895
% 0.19/0.51 % (25667)Time elapsed: 0.055 s
% 0.19/0.51 % (25667)Instructions burned: 4 (million)
% 0.19/0.51 % (25667)------------------------------
% 0.19/0.51 % (25667)------------------------------
% 0.19/0.51 % (25643)Success in time 0.162 s
%------------------------------------------------------------------------------