TSTP Solution File: SEU230+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU230+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 : n012.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:41 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 140 ( 40 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 179 ( 67 ~; 68 |; 35 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 67 ( 58 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f235,plain,
$false,
inference(subsumption_resolution,[],[f228,f163]) ).
fof(f163,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f162]) ).
fof(f162,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f138]) ).
fof(f138,plain,
! [X2,X0,X1] :
( in(X2,X1)
| X0 != X2
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ( ( ~ in(sK8(X0,X1),X1)
| sK8(X0,X1) != X0 )
& ( in(sK8(X0,X1),X1)
| sK8(X0,X1) = X0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f91,f92]) ).
fof(f92,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) )
=> ( ( ~ in(sK8(X0,X1),X1)
| sK8(X0,X1) != X0 )
& ( in(sK8(X0,X1),X1)
| sK8(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) ) ) ),
inference(rectify,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f228,plain,
~ in(sK6,singleton(sK6)),
inference(resolution,[],[f164,f159]) ).
fof(f159,plain,
~ in(sK6,set_union2(sK6,singleton(sK6))),
inference(definition_unfolding,[],[f125,f116]) ).
fof(f116,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f125,plain,
~ in(sK6,succ(sK6)),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
~ in(sK6,succ(sK6)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f59,f83]) ).
fof(f83,plain,
( ? [X0] : ~ in(X0,succ(X0))
=> ~ in(sK6,succ(sK6)) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
? [X0] : ~ in(X0,succ(X0)),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X0] : in(X0,succ(X0)),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f164,plain,
! [X2,X1,X4] :
( in(X4,set_union2(X2,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f153]) ).
fof(f153,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X1)
| set_union2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ( set_union2(X2,X1) = X0
| ( ( ( ~ in(sK12(X0,X1,X2),X1)
& ~ in(sK12(X0,X1,X2),X2) )
| ~ in(sK12(X0,X1,X2),X0) )
& ( in(sK12(X0,X1,X2),X1)
| in(sK12(X0,X1,X2),X2)
| in(sK12(X0,X1,X2),X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) )
& ( in(X4,X1)
| in(X4,X2)
| ~ in(X4,X0) ) )
| set_union2(X2,X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f105,f106]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) )
=> ( ( ( ~ in(sK12(X0,X1,X2),X1)
& ~ in(sK12(X0,X1,X2),X2) )
| ~ in(sK12(X0,X1,X2),X0) )
& ( in(sK12(X0,X1,X2),X1)
| in(sK12(X0,X1,X2),X2)
| in(sK12(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ( set_union2(X2,X1) = X0
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) )
& ( in(X4,X1)
| in(X4,X2)
| ~ in(X4,X0) ) )
| set_union2(X2,X1) != X0 ) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
! [X1,X0,X2] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X0)
| in(X3,X2)
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X0)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X2)
| ~ in(X3,X1) ) )
| set_union2(X2,X0) != X1 ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
! [X1,X0,X2] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X0)
| in(X3,X2)
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ( ~ in(X3,X0)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X2)
| ~ in(X3,X1) ) )
| set_union2(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X1,X0,X2] :
( set_union2(X2,X0) = X1
<=> ! [X3] :
( in(X3,X1)
<=> ( in(X3,X0)
| in(X3,X2) ) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X2,X0] :
( 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 : SEU230+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.14/0.33 % Computer : n012.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 30 14:53:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.19/0.48 % (9691)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (9684)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 (2999ds/191324Mi)
% 0.19/0.49 % (9701)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.50 % (9696)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.50 TRYING [1]
% 0.19/0.50 % (9699)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.50 % (9692)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50 TRYING [2]
% 0.19/0.50 TRYING [1]
% 0.19/0.50 TRYING [3]
% 0.19/0.50 % (9691)First to succeed.
% 0.19/0.51 % (9707)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.51 TRYING [4]
% 0.19/0.51 % (9695)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 TRYING [2]
% 0.19/0.51 % (9696)Also succeeded, but the first one will report.
% 0.19/0.51 TRYING [3]
% 0.19/0.51 % (9692)Instruction limit reached!
% 0.19/0.51 % (9692)------------------------------
% 0.19/0.51 % (9692)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (9692)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (9692)Termination reason: Unknown
% 0.19/0.51 % (9692)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (9692)Memory used [KB]: 895
% 0.19/0.51 % (9692)Time elapsed: 0.004 s
% 0.19/0.51 % (9692)Instructions burned: 2 (million)
% 0.19/0.51 % (9692)------------------------------
% 0.19/0.51 % (9692)------------------------------
% 0.19/0.51 % (9691)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 % (9691)------------------------------
% 0.19/0.51 % (9691)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (9691)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (9691)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (9691)Memory used [KB]: 5500
% 0.19/0.51 % (9691)Time elapsed: 0.106 s
% 0.19/0.51 % (9691)Instructions burned: 5 (million)
% 0.19/0.51 % (9691)------------------------------
% 0.19/0.51 % (9691)------------------------------
% 0.19/0.51 % (9683)Success in time 0.164 s
%------------------------------------------------------------------------------