TSTP Solution File: SEU230+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU230+3 : 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_uns --cores 0 -t %d %s
% Computer : n017.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.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 139 ( 40 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 178 ( 66 ~; 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(f166,plain,
$false,
inference(unit_resulting_resolution,[],[f163,f157,f160]) ).
fof(f160,plain,
! [X2,X1,X4] :
( in(X4,set_union2(X1,X2))
| ~ in(X4,X2) ),
inference(equality_resolution,[],[f119]) ).
fof(f119,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_union2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X2) = X0
| ( ( ~ in(sK5(X0,X1,X2),X0)
| ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X2) ) )
& ( in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X2)
| ~ in(X4,X0) )
& ( in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) ) )
| set_union2(X1,X2) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f79,f80]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) )
=> ( ( ~ in(sK5(X0,X1,X2),X0)
| ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X2) ) )
& ( in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X2) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X2)
| ~ in(X4,X0) )
& ( in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) ) )
| set_union2(X1,X2) != X0 ) ),
inference(rectify,[],[f78]) ).
fof(f78,plain,
! [X1,X2,X0] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 ) ),
inference(flattening,[],[f77]) ).
fof(f77,plain,
! [X1,X2,X0] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X1,X2,X0] :
( set_union2(X2,X0) = X1
<=> ! [X3] :
( ( in(X3,X2)
| in(X3,X0) )
<=> in(X3,X1) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X2,X0] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) )
<=> set_union2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f157,plain,
~ in(sK10,set_union2(sK10,singleton(sK10))),
inference(definition_unfolding,[],[f139,f140]) ).
fof(f140,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(f139,plain,
~ in(sK10,succ(sK10)),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
~ in(sK10,succ(sK10)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f65,f92]) ).
fof(f92,plain,
( ? [X0] : ~ in(X0,succ(X0))
=> ~ in(sK10,succ(sK10)) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
? [X0] : ~ in(X0,succ(X0)),
inference(ennf_transformation,[],[f29]) ).
fof(f29,negated_conjecture,
~ ! [X0] : in(X0,succ(X0)),
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f163,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f162]) ).
fof(f162,plain,
! [X3,X0] :
( in(X3,X0)
| singleton(X3) != X0 ),
inference(equality_resolution,[],[f129]) ).
fof(f129,plain,
! [X3,X0,X1] :
( in(X3,X0)
| X1 != X3
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ( ( ~ in(sK7(X0,X1),X0)
| sK7(X0,X1) != X1 )
& ( in(sK7(X0,X1),X0)
| sK7(X0,X1) = X1 ) ) )
& ( ! [X3] :
( ( X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| X1 != X3 ) )
| singleton(X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f85,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) )
=> ( ( ~ in(sK7(X0,X1),X0)
| sK7(X0,X1) != X1 )
& ( in(sK7(X0,X1),X0)
| sK7(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) )
& ( ! [X3] :
( ( X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| X1 != X3 ) )
| singleton(X1) != X0 ) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
! [X1,X0] :
( ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) )
& ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( singleton(X0) = X1
<=> ! [X2] :
( X0 = X2
<=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU230+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:18:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (27011)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.49 % (27019)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49 % (27011)First to succeed.
% 0.20/0.49 % (27011)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (27011)------------------------------
% 0.20/0.49 % (27011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (27011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (27011)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (27011)Memory used [KB]: 6012
% 0.20/0.49 % (27011)Time elapsed: 0.091 s
% 0.20/0.49 % (27011)Instructions burned: 3 (million)
% 0.20/0.49 % (27011)------------------------------
% 0.20/0.49 % (27011)------------------------------
% 0.20/0.49 % (27003)Success in time 0.141 s
%------------------------------------------------------------------------------