TSTP Solution File: SET959+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.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:26:12 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 8 unt; 0 def)
% Number of atoms : 232 ( 71 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 261 ( 103 ~; 95 |; 42 &)
% ( 11 <=>; 9 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 160 ( 119 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f284,plain,
$false,
inference(avatar_sat_refutation,[],[f97,f126,f142,f230,f280,f281,f283]) ).
fof(f283,plain,
( spl9_6
| ~ spl9_1
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f282,f119,f90,f123]) ).
fof(f123,plain,
( spl9_6
<=> in(sK0(sK1,sK2),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_6])]) ).
fof(f90,plain,
( spl9_1
<=> unordered_pair(singleton(sK4(sK0(sK1,sK2))),unordered_pair(sK3(sK0(sK1,sK2)),sK4(sK0(sK1,sK2)))) = sK0(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f119,plain,
( spl9_5
<=> in(sK0(sK1,sK2),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f282,plain,
( in(sK0(sK1,sK2),sK2)
| ~ spl9_1
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f236,f120]) ).
fof(f120,plain,
( in(sK0(sK1,sK2),sK1)
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f236,plain,
( ~ in(sK0(sK1,sK2),sK1)
| in(sK0(sK1,sK2),sK2)
| ~ spl9_1 ),
inference(superposition,[],[f77,f92]) ).
fof(f92,plain,
( unordered_pair(singleton(sK4(sK0(sK1,sK2))),unordered_pair(sK3(sK0(sK1,sK2)),sK4(sK0(sK1,sK2)))) = sK0(sK1,sK2)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f77,plain,
! [X2,X3] :
( ~ in(unordered_pair(singleton(X2),unordered_pair(X3,X2)),sK1)
| in(unordered_pair(singleton(X2),unordered_pair(X3,X2)),sK2) ),
inference(superposition,[],[f58,f42]) ).
fof(f42,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f58,plain,
! [X6,X5] :
( ~ in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK1)
| in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK2) ),
inference(forward_demodulation,[],[f57,f42]) ).
fof(f57,plain,
! [X6,X5] :
( ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK1)
| in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK2) ),
inference(forward_demodulation,[],[f46,f42]) ).
fof(f46,plain,
! [X6,X5] :
( in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK2)
| ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK1) ),
inference(definition_unfolding,[],[f39,f35,f35]) ).
fof(f35,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f39,plain,
! [X6,X5] :
( in(ordered_pair(X6,X5),sK2)
| ~ in(ordered_pair(X6,X5),sK1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( ! [X2] :
( ~ in(X2,sK1)
| ordered_pair(sK4(X2),sK3(X2)) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X6,X5),sK2)
| ~ in(ordered_pair(X6,X5),sK1) )
& ( in(ordered_pair(X6,X5),sK1)
| ~ in(ordered_pair(X6,X5),sK2) ) )
& sK2 != sK1
& ! [X7] :
( ~ in(X7,sK2)
| ordered_pair(sK6(X7),sK5(X7)) = X7 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6])],[f21,f24,f23,f22]) ).
fof(f22,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X4,X3) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X6,X5),X1)
| ~ in(ordered_pair(X6,X5),X0) )
& ( in(ordered_pair(X6,X5),X0)
| ~ in(ordered_pair(X6,X5),X1) ) )
& X0 != X1
& ! [X7] :
( ~ in(X7,X1)
| ? [X8,X9] : ordered_pair(X9,X8) = X7 ) )
=> ( ! [X2] :
( ~ in(X2,sK1)
| ? [X3,X4] : ordered_pair(X4,X3) = X2 )
& ! [X6,X5] :
( ( in(ordered_pair(X6,X5),sK2)
| ~ in(ordered_pair(X6,X5),sK1) )
& ( in(ordered_pair(X6,X5),sK1)
| ~ in(ordered_pair(X6,X5),sK2) ) )
& sK2 != sK1
& ! [X7] :
( ~ in(X7,sK2)
| ? [X8,X9] : ordered_pair(X9,X8) = X7 ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X2] :
( ? [X3,X4] : ordered_pair(X4,X3) = X2
=> ordered_pair(sK4(X2),sK3(X2)) = X2 ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X7] :
( ? [X8,X9] : ordered_pair(X9,X8) = X7
=> ordered_pair(sK6(X7),sK5(X7)) = X7 ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X4,X3) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X6,X5),X1)
| ~ in(ordered_pair(X6,X5),X0) )
& ( in(ordered_pair(X6,X5),X0)
| ~ in(ordered_pair(X6,X5),X1) ) )
& X0 != X1
& ! [X7] :
( ~ in(X7,X1)
| ? [X8,X9] : ordered_pair(X9,X8) = X7 ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
? [X1,X0] :
( ! [X7] :
( ~ in(X7,X1)
| ? [X9,X8] : ordered_pair(X8,X9) = X7 )
& ! [X2,X3] :
( ( in(ordered_pair(X3,X2),X0)
| ~ in(ordered_pair(X3,X2),X1) )
& ( in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X3,X2),X0) ) )
& X0 != X1
& ! [X4] :
( ~ in(X4,X0)
| ? [X5,X6] : ordered_pair(X6,X5) = X4 ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
? [X1,X0] :
( ! [X7] :
( ~ in(X7,X1)
| ? [X9,X8] : ordered_pair(X8,X9) = X7 )
& ! [X2,X3] :
( in(ordered_pair(X3,X2),X0)
<=> in(ordered_pair(X3,X2),X1) )
& X0 != X1
& ! [X4] :
( ~ in(X4,X0)
| ? [X5,X6] : ordered_pair(X6,X5) = X4 ) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
? [X0,X1] :
( X0 != X1
& ! [X7] :
( ~ in(X7,X1)
| ? [X9,X8] : ordered_pair(X8,X9) = X7 )
& ! [X4] :
( ~ in(X4,X0)
| ? [X5,X6] : ordered_pair(X6,X5) = X4 )
& ! [X2,X3] :
( in(ordered_pair(X3,X2),X0)
<=> in(ordered_pair(X3,X2),X1) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X1] :
( ( ! [X7] :
~ ( in(X7,X1)
& ! [X9,X8] : ordered_pair(X8,X9) != X7 )
& ! [X4] :
~ ( in(X4,X0)
& ! [X6,X5] : ordered_pair(X6,X5) != X4 )
& ! [X2,X3] :
( in(ordered_pair(X3,X2),X0)
<=> in(ordered_pair(X3,X2),X1) ) )
=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
( ( ! [X3,X2] :
( in(ordered_pair(X2,X3),X1)
<=> in(ordered_pair(X2,X3),X0) )
& ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X0) ) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
( ( ! [X3,X2] :
( in(ordered_pair(X2,X3),X1)
<=> in(ordered_pair(X2,X3),X0) )
& ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X0) ) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t112_zfmisc_1) ).
fof(f281,plain,
( spl9_2
| ~ spl9_6 ),
inference(avatar_split_clause,[],[f275,f123,f94]) ).
fof(f94,plain,
( spl9_2
<=> sK0(sK1,sK2) = unordered_pair(singleton(sK6(sK0(sK1,sK2))),unordered_pair(sK5(sK0(sK1,sK2)),sK6(sK0(sK1,sK2)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f275,plain,
( sK0(sK1,sK2) = unordered_pair(singleton(sK6(sK0(sK1,sK2))),unordered_pair(sK5(sK0(sK1,sK2)),sK6(sK0(sK1,sK2))))
| ~ spl9_6 ),
inference(resolution,[],[f125,f54]) ).
fof(f54,plain,
! [X7] :
( ~ in(X7,sK2)
| unordered_pair(singleton(sK6(X7)),unordered_pair(sK5(X7),sK6(X7))) = X7 ),
inference(forward_demodulation,[],[f53,f42]) ).
fof(f53,plain,
! [X7] :
( ~ in(X7,sK2)
| unordered_pair(singleton(sK6(X7)),unordered_pair(sK6(X7),sK5(X7))) = X7 ),
inference(backward_demodulation,[],[f48,f42]) ).
fof(f48,plain,
! [X7] :
( unordered_pair(unordered_pair(sK6(X7),sK5(X7)),singleton(sK6(X7))) = X7
| ~ in(X7,sK2) ),
inference(definition_unfolding,[],[f36,f35]) ).
fof(f36,plain,
! [X7] :
( ~ in(X7,sK2)
| ordered_pair(sK6(X7),sK5(X7)) = X7 ),
inference(cnf_transformation,[],[f25]) ).
fof(f125,plain,
( in(sK0(sK1,sK2),sK2)
| ~ spl9_6 ),
inference(avatar_component_clause,[],[f123]) ).
fof(f280,plain,
( ~ spl9_5
| ~ spl9_6 ),
inference(avatar_contradiction_clause,[],[f279]) ).
fof(f279,plain,
( $false
| ~ spl9_5
| ~ spl9_6 ),
inference(subsumption_resolution,[],[f278,f37]) ).
fof(f37,plain,
sK2 != sK1,
inference(cnf_transformation,[],[f25]) ).
fof(f278,plain,
( sK2 = sK1
| ~ spl9_5
| ~ spl9_6 ),
inference(subsumption_resolution,[],[f276,f120]) ).
fof(f276,plain,
( ~ in(sK0(sK1,sK2),sK1)
| sK2 = sK1
| ~ spl9_6 ),
inference(resolution,[],[f125,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| ~ in(sK0(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( in(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f17,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X0)
| ~ in(X2,X1) )
& ( in(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ in(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( in(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X0)
| ~ in(X2,X1) )
& ( in(X2,X0)
| in(X2,X1) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X1)
<~> in(X2,X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f230,plain,
( spl9_6
| spl9_5 ),
inference(avatar_split_clause,[],[f229,f119,f123]) ).
fof(f229,plain,
( in(sK0(sK1,sK2),sK2)
| spl9_5 ),
inference(subsumption_resolution,[],[f225,f37]) ).
fof(f225,plain,
( sK2 = sK1
| in(sK0(sK1,sK2),sK2)
| spl9_5 ),
inference(resolution,[],[f121,f32]) ).
fof(f32,plain,
! [X0,X1] :
( in(sK0(X0,X1),X1)
| in(sK0(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f121,plain,
( ~ in(sK0(sK1,sK2),sK1)
| spl9_5 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f142,plain,
( spl9_5
| ~ spl9_6
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f99,f94,f123,f119]) ).
fof(f99,plain,
( ~ in(sK0(sK1,sK2),sK2)
| in(sK0(sK1,sK2),sK1)
| ~ spl9_2 ),
inference(superposition,[],[f75,f96]) ).
fof(f96,plain,
( sK0(sK1,sK2) = unordered_pair(singleton(sK6(sK0(sK1,sK2))),unordered_pair(sK5(sK0(sK1,sK2)),sK6(sK0(sK1,sK2))))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f75,plain,
! [X2,X3] :
( ~ in(unordered_pair(singleton(X2),unordered_pair(X3,X2)),sK2)
| in(unordered_pair(singleton(X2),unordered_pair(X3,X2)),sK1) ),
inference(superposition,[],[f56,f42]) ).
fof(f56,plain,
! [X6,X5] :
( ~ in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK2)
| in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK1) ),
inference(forward_demodulation,[],[f50,f42]) ).
fof(f50,plain,
! [X6,X5] :
( ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK2)
| in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),sK1) ),
inference(backward_demodulation,[],[f47,f42]) ).
fof(f47,plain,
! [X6,X5] :
( ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK2)
| in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),sK1) ),
inference(definition_unfolding,[],[f38,f35,f35]) ).
fof(f38,plain,
! [X6,X5] :
( in(ordered_pair(X6,X5),sK1)
| ~ in(ordered_pair(X6,X5),sK2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f126,plain,
( ~ spl9_5
| spl9_6
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f98,f94,f123,f119]) ).
fof(f98,plain,
( in(sK0(sK1,sK2),sK2)
| ~ in(sK0(sK1,sK2),sK1)
| ~ spl9_2 ),
inference(superposition,[],[f77,f96]) ).
fof(f97,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f88,f94,f90]) ).
fof(f88,plain,
( sK0(sK1,sK2) = unordered_pair(singleton(sK6(sK0(sK1,sK2))),unordered_pair(sK5(sK0(sK1,sK2)),sK6(sK0(sK1,sK2))))
| unordered_pair(singleton(sK4(sK0(sK1,sK2))),unordered_pair(sK3(sK0(sK1,sK2)),sK4(sK0(sK1,sK2)))) = sK0(sK1,sK2) ),
inference(subsumption_resolution,[],[f84,f37]) ).
fof(f84,plain,
( unordered_pair(singleton(sK4(sK0(sK1,sK2))),unordered_pair(sK3(sK0(sK1,sK2)),sK4(sK0(sK1,sK2)))) = sK0(sK1,sK2)
| sK2 = sK1
| sK0(sK1,sK2) = unordered_pair(singleton(sK6(sK0(sK1,sK2))),unordered_pair(sK5(sK0(sK1,sK2)),sK6(sK0(sK1,sK2)))) ),
inference(resolution,[],[f70,f55]) ).
fof(f55,plain,
! [X2] :
( ~ in(X2,sK1)
| unordered_pair(singleton(sK4(X2)),unordered_pair(sK3(X2),sK4(X2))) = X2 ),
inference(forward_demodulation,[],[f52,f42]) ).
fof(f52,plain,
! [X2] :
( unordered_pair(singleton(sK4(X2)),unordered_pair(sK4(X2),sK3(X2))) = X2
| ~ in(X2,sK1) ),
inference(backward_demodulation,[],[f45,f42]) ).
fof(f45,plain,
! [X2] :
( unordered_pair(unordered_pair(sK4(X2),sK3(X2)),singleton(sK4(X2))) = X2
| ~ in(X2,sK1) ),
inference(definition_unfolding,[],[f40,f35]) ).
fof(f40,plain,
! [X2] :
( ~ in(X2,sK1)
| ordered_pair(sK4(X2),sK3(X2)) = X2 ),
inference(cnf_transformation,[],[f25]) ).
fof(f70,plain,
! [X0] :
( in(sK0(X0,sK2),X0)
| unordered_pair(singleton(sK6(sK0(X0,sK2))),unordered_pair(sK5(sK0(X0,sK2)),sK6(sK0(X0,sK2)))) = sK0(X0,sK2)
| sK2 = X0 ),
inference(resolution,[],[f54,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/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:29:02 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (28977)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53 % (28969)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (28977)First to succeed.
% 0.20/0.55 % (28977)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 % (28977)------------------------------
% 0.20/0.55 % (28977)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (28977)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (28977)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (28977)Memory used [KB]: 5628
% 0.20/0.55 % (28977)Time elapsed: 0.118 s
% 0.20/0.55 % (28977)Instructions burned: 9 (million)
% 0.20/0.55 % (28977)------------------------------
% 0.20/0.55 % (28977)------------------------------
% 0.20/0.55 % (28958)Success in time 0.2 s
%------------------------------------------------------------------------------