TSTP Solution File: SEU230+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n019.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:27:45 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 149 ( 44 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 184 ( 69 ~; 69 |; 35 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 62 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f399,plain,
$false,
inference(subsumption_resolution,[],[f397,f164]) ).
fof(f164,plain,
in(sK6,sF13),
inference(superposition,[],[f157,f161]) ).
fof(f161,plain,
sF13 = singleton(sK6),
introduced(function_definition,[]) ).
fof(f157,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f156]) ).
fof(f156,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f107]) ).
fof(f107,plain,
! [X2,X0,X1] :
( in(X2,X1)
| X0 != X2
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ( ( ~ in(sK1(X0,X1),X1)
| sK1(X0,X1) != X0 )
& ( in(sK1(X0,X1),X1)
| sK1(X0,X1) = X0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f71,f72]) ).
fof(f72,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) )
=> ( ( ~ in(sK1(X0,X1),X1)
| sK1(X0,X1) != X0 )
& ( in(sK1(X0,X1),X1)
| sK1(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f71,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,[],[f70]) ).
fof(f70,plain,
! [X1,X0] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X1,X0] :
( ! [X2] :
( X1 = X2
<=> in(X2,X0) )
<=> singleton(X1) = X0 ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f397,plain,
~ in(sK6,sF13),
inference(resolution,[],[f390,f163]) ).
fof(f163,plain,
~ in(sK6,sF14),
inference(definition_folding,[],[f154,f162,f161]) ).
fof(f162,plain,
set_union2(sK6,sF13) = sF14,
introduced(function_definition,[]) ).
fof(f154,plain,
~ in(sK6,set_union2(sK6,singleton(sK6))),
inference(definition_unfolding,[],[f120,f146]) ).
fof(f146,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(f120,plain,
~ in(sK6,succ(sK6)),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
~ in(sK6,succ(sK6)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f67,f83]) ).
fof(f83,plain,
( ? [X0] : ~ in(X0,succ(X0))
=> ~ in(sK6,succ(sK6)) ),
introduced(choice_axiom,[]) ).
fof(f67,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(f390,plain,
! [X16] :
( in(X16,sF14)
| ~ in(X16,sF13) ),
inference(superposition,[],[f159,f162]) ).
fof(f159,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X1,X0))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f139]) ).
fof(f139,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X0) = X2
| ( ( ( ~ in(sK11(X0,X1,X2),X1)
& ~ in(sK11(X0,X1,X2),X0) )
| ~ in(sK11(X0,X1,X2),X2) )
& ( in(sK11(X0,X1,X2),X1)
| in(sK11(X0,X1,X2),X0)
| in(sK11(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X1,X0) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f96,f97]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK11(X0,X1,X2),X1)
& ~ in(sK11(X0,X1,X2),X0) )
| ~ in(sK11(X0,X1,X2),X2) )
& ( in(sK11(X0,X1,X2),X1)
| in(sK11(X0,X1,X2),X0)
| in(sK11(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X0) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X1,X0) != X2 ) ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
! [X2,X1,X0] :
( ( set_union2(X1,X2) = X0
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) )
& ( in(X3,X1)
| in(X3,X2)
| ~ in(X3,X0) ) )
| set_union2(X1,X2) != X0 ) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X2,X1,X0] :
( ( set_union2(X1,X2) = X0
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) )
& ( in(X3,X1)
| in(X3,X2)
| ~ in(X3,X0) ) )
| set_union2(X1,X2) != X0 ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X2,X1,X0] :
( set_union2(X1,X2) = X0
<=> ! [X3] :
( in(X3,X0)
<=> ( in(X3,X1)
| in(X3,X2) ) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X2,X0,X1] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
| in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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.12/0.34 % Computer : n019.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:57:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 % (11169)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.19/0.46 % (11169)First to succeed.
% 0.19/0.47 % (11177)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.47 % (11185)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.47 % (11169)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (11169)------------------------------
% 0.19/0.47 % (11169)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (11169)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (11169)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (11169)Memory used [KB]: 6140
% 0.19/0.47 % (11169)Time elapsed: 0.068 s
% 0.19/0.47 % (11169)Instructions burned: 10 (million)
% 0.19/0.47 % (11169)------------------------------
% 0.19/0.47 % (11169)------------------------------
% 0.19/0.47 % (11165)Success in time 0.127 s
%------------------------------------------------------------------------------