TSTP Solution File: MGT009+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT009+1 : TPTP v8.1.0. Released v2.0.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 : n024.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 17:50:51 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 70 ( 16 unt; 0 def)
% Number of atoms : 382 ( 0 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 499 ( 187 ~; 166 |; 128 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 245 ( 204 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f151,plain,
$false,
inference(avatar_sat_refutation,[],[f131,f144,f147,f150]) ).
fof(f150,plain,
~ spl10_9,
inference(avatar_contradiction_clause,[],[f149]) ).
fof(f149,plain,
( $false
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f148,f28]) ).
fof(f28,plain,
class(sK0,sK4,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( size(sK0,sK1,sK3)
& size(sK7,sK8,sK2)
& ~ greater(sK5,sK6)
& reproducibility(sK7,sK6,sK2)
& organization(sK0,sK3)
& organization(sK7,sK2)
& class(sK7,sK4,sK2)
& reproducibility(sK0,sK5,sK3)
& reorganization_free(sK7,sK2,sK2)
& class(sK0,sK4,sK3)
& reorganization_free(sK0,sK3,sK3)
& greater(sK1,sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f17,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( size(X0,X1,X3)
& size(X7,X8,X2)
& ~ greater(X5,X6)
& reproducibility(X7,X6,X2)
& organization(X0,X3)
& organization(X7,X2)
& class(X7,X4,X2)
& reproducibility(X0,X5,X3)
& reorganization_free(X7,X2,X2)
& class(X0,X4,X3)
& reorganization_free(X0,X3,X3)
& greater(X1,X8) )
=> ( size(sK0,sK1,sK3)
& size(sK7,sK8,sK2)
& ~ greater(sK5,sK6)
& reproducibility(sK7,sK6,sK2)
& organization(sK0,sK3)
& organization(sK7,sK2)
& class(sK7,sK4,sK2)
& reproducibility(sK0,sK5,sK3)
& reorganization_free(sK7,sK2,sK2)
& class(sK0,sK4,sK3)
& reorganization_free(sK0,sK3,sK3)
& greater(sK1,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( size(X0,X1,X3)
& size(X7,X8,X2)
& ~ greater(X5,X6)
& reproducibility(X7,X6,X2)
& organization(X0,X3)
& organization(X7,X2)
& class(X7,X4,X2)
& reproducibility(X0,X5,X3)
& reorganization_free(X7,X2,X2)
& class(X0,X4,X3)
& reorganization_free(X0,X3,X3)
& greater(X1,X8) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X1,X6,X8,X0,X2,X5,X7,X4,X3] :
( size(X1,X6,X0)
& size(X4,X3,X8)
& ~ greater(X5,X7)
& reproducibility(X4,X7,X8)
& organization(X1,X0)
& organization(X4,X8)
& class(X4,X2,X8)
& reproducibility(X1,X5,X0)
& reorganization_free(X4,X8,X8)
& class(X1,X2,X0)
& reorganization_free(X1,X0,X0)
& greater(X6,X3) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X3,X4,X5,X0,X8,X1,X6,X7,X2] :
( ~ greater(X5,X7)
& reproducibility(X1,X5,X0)
& class(X4,X2,X8)
& reorganization_free(X4,X8,X8)
& greater(X6,X3)
& reorganization_free(X1,X0,X0)
& size(X4,X3,X8)
& reproducibility(X4,X7,X8)
& size(X1,X6,X0)
& organization(X4,X8)
& organization(X1,X0)
& class(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X3,X4,X5,X0,X8,X1,X6,X7,X2] :
( ( reproducibility(X1,X5,X0)
& class(X4,X2,X8)
& reorganization_free(X4,X8,X8)
& greater(X6,X3)
& reorganization_free(X1,X0,X0)
& size(X4,X3,X8)
& reproducibility(X4,X7,X8)
& size(X1,X6,X0)
& organization(X4,X8)
& organization(X1,X0)
& class(X1,X2,X0) )
=> greater(X5,X7) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X5,X3,X10,X11,X0,X7,X12,X6,X4] :
( ( class(X3,X10,X5)
& reproducibility(X3,X7,X5)
& class(X0,X10,X4)
& size(X0,X11,X4)
& organization(X0,X4)
& size(X3,X12,X5)
& reorganization_free(X0,X4,X4)
& reproducibility(X0,X6,X4)
& greater(X12,X11)
& organization(X3,X5)
& reorganization_free(X3,X5,X5) )
=> greater(X7,X6) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X5,X3,X10,X11,X0,X7,X12,X6,X4] :
( ( class(X3,X10,X5)
& reproducibility(X3,X7,X5)
& class(X0,X10,X4)
& size(X0,X11,X4)
& organization(X0,X4)
& size(X3,X12,X5)
& reorganization_free(X0,X4,X4)
& reproducibility(X0,X6,X4)
& greater(X12,X11)
& organization(X3,X5)
& reorganization_free(X3,X5,X5) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL) ).
fof(f148,plain,
( ~ class(sK0,sK4,sK3)
| ~ spl10_9 ),
inference(resolution,[],[f130,f31]) ).
fof(f31,plain,
class(sK7,sK4,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f130,plain,
( ! [X3] :
( ~ class(sK7,X3,sK2)
| ~ class(sK0,X3,sK3) )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f129,plain,
( spl10_9
<=> ! [X3] :
( ~ class(sK0,X3,sK3)
| ~ class(sK7,X3,sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
fof(f147,plain,
~ spl10_8,
inference(avatar_contradiction_clause,[],[f146]) ).
fof(f146,plain,
( $false
| ~ spl10_8 ),
inference(subsumption_resolution,[],[f145,f33]) ).
fof(f33,plain,
organization(sK0,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f145,plain,
( ~ organization(sK0,sK3)
| ~ spl10_8 ),
inference(resolution,[],[f127,f38]) ).
fof(f38,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
=> inertia(X0,sK9(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ? [X2] : inertia(X1,X2,X0)
| ~ organization(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( organization(X1,X0)
=> ? [X2] : inertia(X1,X2,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(f127,plain,
( ! [X4] : ~ inertia(sK0,X4,sK3)
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f126,plain,
( spl10_8
<=> ! [X4] : ~ inertia(sK0,X4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f144,plain,
~ spl10_7,
inference(avatar_contradiction_clause,[],[f143]) ).
fof(f143,plain,
( $false
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f142,f32]) ).
fof(f32,plain,
organization(sK7,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f142,plain,
( ~ organization(sK7,sK2)
| ~ spl10_7 ),
inference(resolution,[],[f124,f38]) ).
fof(f124,plain,
( ! [X5] : ~ inertia(sK7,X5,sK2)
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f123]) ).
fof(f123,plain,
( spl10_7
<=> ! [X5] : ~ inertia(sK7,X5,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f131,plain,
( spl10_7
| spl10_8
| spl10_9 ),
inference(avatar_split_clause,[],[f121,f129,f126,f123]) ).
fof(f121,plain,
! [X3,X4,X5] :
( ~ class(sK0,X3,sK3)
| ~ inertia(sK0,X4,sK3)
| ~ class(sK7,X3,sK2)
| ~ inertia(sK7,X5,sK2) ),
inference(subsumption_resolution,[],[f120,f108]) ).
fof(f108,plain,
! [X0,X1] :
( ~ inertia(sK7,X0,sK2)
| ~ inertia(sK0,X1,sK3)
| ~ greater(X1,X0) ),
inference(subsumption_resolution,[],[f107,f35]) ).
fof(f35,plain,
~ greater(sK5,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f107,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| greater(sK5,sK6)
| ~ inertia(sK7,X0,sK2)
| ~ inertia(sK0,X1,sK3) ),
inference(subsumption_resolution,[],[f106,f27]) ).
fof(f27,plain,
reorganization_free(sK0,sK3,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f106,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ reorganization_free(sK0,sK3,sK3)
| greater(sK5,sK6)
| ~ inertia(sK0,X1,sK3)
| ~ inertia(sK7,X0,sK2) ),
inference(subsumption_resolution,[],[f104,f33]) ).
fof(f104,plain,
! [X0,X1] :
( ~ organization(sK0,sK3)
| ~ greater(X1,X0)
| greater(sK5,sK6)
| ~ inertia(sK7,X0,sK2)
| ~ inertia(sK0,X1,sK3)
| ~ reorganization_free(sK0,sK3,sK3) ),
inference(resolution,[],[f87,f30]) ).
fof(f30,plain,
reproducibility(sK0,sK5,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f87,plain,
! [X8,X6,X9,X7,X5] :
( ~ reproducibility(X5,X8,X7)
| ~ inertia(sK7,X9,sK2)
| ~ organization(X5,X7)
| ~ reorganization_free(X5,X7,X7)
| ~ inertia(X5,X6,X7)
| ~ greater(X6,X9)
| greater(X8,sK6) ),
inference(subsumption_resolution,[],[f86,f29]) ).
fof(f29,plain,
reorganization_free(sK7,sK2,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f86,plain,
! [X8,X6,X9,X7,X5] :
( ~ inertia(X5,X6,X7)
| ~ organization(X5,X7)
| greater(X8,sK6)
| ~ reorganization_free(sK7,sK2,sK2)
| ~ inertia(sK7,X9,sK2)
| ~ reorganization_free(X5,X7,X7)
| ~ greater(X6,X9)
| ~ reproducibility(X5,X8,X7) ),
inference(subsumption_resolution,[],[f83,f32]) ).
fof(f83,plain,
! [X8,X6,X9,X7,X5] :
( ~ organization(sK7,sK2)
| ~ inertia(X5,X6,X7)
| greater(X8,sK6)
| ~ inertia(sK7,X9,sK2)
| ~ reorganization_free(X5,X7,X7)
| ~ reorganization_free(sK7,sK2,sK2)
| ~ reproducibility(X5,X8,X7)
| ~ greater(X6,X9)
| ~ organization(X5,X7) ),
inference(resolution,[],[f40,f34]) ).
fof(f34,plain,
reproducibility(sK7,sK6,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ reproducibility(X7,X2,X6)
| ~ inertia(X1,X3,X0)
| ~ reproducibility(X1,X4,X0)
| ~ reorganization_free(X7,X6,X6)
| ~ organization(X1,X0)
| greater(X4,X2)
| ~ reorganization_free(X1,X0,X0)
| ~ greater(X3,X5)
| ~ inertia(X7,X5,X6)
| ~ organization(X7,X6) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ organization(X1,X0)
| ~ inertia(X1,X3,X0)
| ~ inertia(X7,X5,X6)
| ( ( greater(X4,X2)
| ~ greater(X3,X5) )
& ( greater(X3,X5)
| ~ greater(X4,X2) ) )
| ~ organization(X7,X6)
| ~ reproducibility(X7,X2,X6)
| ~ reproducibility(X1,X4,X0)
| ~ reorganization_free(X7,X6,X6)
| ~ reorganization_free(X1,X0,X0) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X4,X3,X0,X7,X2,X1,X5,X6] :
( ~ organization(X3,X4)
| ~ inertia(X3,X7,X4)
| ~ inertia(X6,X1,X5)
| ( ( greater(X2,X0)
| ~ greater(X7,X1) )
& ( greater(X7,X1)
| ~ greater(X2,X0) ) )
| ~ organization(X6,X5)
| ~ reproducibility(X6,X0,X5)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X6,X5,X5)
| ~ reorganization_free(X3,X4,X4) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X4,X3,X0,X7,X2,X1,X5,X6] :
( ~ organization(X3,X4)
| ~ inertia(X3,X7,X4)
| ~ inertia(X6,X1,X5)
| ( greater(X2,X0)
<=> greater(X7,X1) )
| ~ organization(X6,X5)
| ~ reproducibility(X6,X0,X5)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X6,X5,X5)
| ~ reorganization_free(X3,X4,X4) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X3,X0,X1,X5,X6,X4,X7,X2] :
( ( greater(X2,X0)
<=> greater(X7,X1) )
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X6,X5,X5)
| ~ inertia(X3,X7,X4)
| ~ organization(X6,X5)
| ~ inertia(X6,X1,X5)
| ~ reproducibility(X3,X2,X4)
| ~ reproducibility(X6,X0,X5) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
! [X3,X0,X1,X5,X6,X4,X7,X2] :
( ( reorganization_free(X3,X4,X4)
& organization(X3,X4)
& reorganization_free(X6,X5,X5)
& inertia(X3,X7,X4)
& organization(X6,X5)
& inertia(X6,X1,X5)
& reproducibility(X3,X2,X4)
& reproducibility(X6,X0,X5) )
=> ( greater(X2,X0)
<=> greater(X7,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X6,X8,X7,X3,X5,X4,X0,X9] :
( ( reorganization_free(X3,X5,X5)
& inertia(X3,X9,X5)
& reproducibility(X3,X7,X5)
& inertia(X0,X8,X4)
& reorganization_free(X0,X4,X4)
& organization(X3,X5)
& organization(X0,X4)
& reproducibility(X0,X6,X4) )
=> ( greater(X9,X8)
<=> greater(X7,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
fof(f120,plain,
! [X3,X4,X5] :
( ~ inertia(sK7,X5,sK2)
| ~ class(sK7,X3,sK2)
| ~ class(sK0,X3,sK3)
| greater(X4,X5)
| ~ inertia(sK0,X4,sK3) ),
inference(subsumption_resolution,[],[f119,f26]) ).
fof(f26,plain,
greater(sK1,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f119,plain,
! [X3,X4,X5] :
( greater(X4,X5)
| ~ inertia(sK7,X5,sK2)
| ~ inertia(sK0,X4,sK3)
| ~ class(sK0,X3,sK3)
| ~ class(sK7,X3,sK2)
| ~ greater(sK1,sK8) ),
inference(subsumption_resolution,[],[f117,f33]) ).
fof(f117,plain,
! [X3,X4,X5] :
( ~ inertia(sK7,X5,sK2)
| ~ class(sK0,X3,sK3)
| ~ class(sK7,X3,sK2)
| ~ inertia(sK0,X4,sK3)
| ~ organization(sK0,sK3)
| ~ greater(sK1,sK8)
| greater(X4,X5) ),
inference(resolution,[],[f102,f37]) ).
fof(f37,plain,
size(sK0,sK1,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f102,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X3,X2)
| ~ organization(X0,X2)
| ~ class(X0,X1,X2)
| greater(X4,X5)
| ~ inertia(sK7,X5,sK2)
| ~ greater(X3,sK8)
| ~ class(sK7,X1,sK2)
| ~ inertia(X0,X4,X2) ),
inference(subsumption_resolution,[],[f100,f32]) ).
fof(f100,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ class(X0,X1,X2)
| ~ organization(sK7,sK2)
| ~ greater(X3,sK8)
| ~ size(X0,X3,X2)
| ~ inertia(X0,X4,X2)
| ~ organization(X0,X2)
| greater(X4,X5)
| ~ class(sK7,X1,sK2)
| ~ inertia(sK7,X5,sK2) ),
inference(resolution,[],[f41,f36]) ).
fof(f36,plain,
size(sK7,sK8,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X8,X5,X6)
| ~ class(X2,X3,X0)
| ~ size(X2,X1,X0)
| ~ organization(X8,X6)
| ~ greater(X1,X5)
| ~ class(X8,X3,X6)
| greater(X4,X7)
| ~ inertia(X2,X4,X0)
| ~ organization(X2,X0)
| ~ inertia(X8,X7,X6) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X4,X7)
| ~ inertia(X8,X7,X6)
| ~ organization(X2,X0)
| ~ inertia(X2,X4,X0)
| ~ size(X2,X1,X0)
| ~ class(X2,X3,X0)
| ~ greater(X1,X5)
| ~ size(X8,X5,X6)
| ~ organization(X8,X6)
| ~ class(X8,X3,X6) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X0,X4,X7,X1,X3,X8,X2,X6,X5] :
( greater(X3,X6)
| ~ inertia(X5,X6,X2)
| ~ organization(X7,X0)
| ~ inertia(X7,X3,X0)
| ~ size(X7,X4,X0)
| ~ class(X7,X1,X0)
| ~ greater(X4,X8)
| ~ size(X5,X8,X2)
| ~ organization(X5,X2)
| ~ class(X5,X1,X2) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
! [X8,X0,X2,X4,X1,X7,X3,X5,X6] :
( greater(X3,X6)
| ~ greater(X4,X8)
| ~ class(X5,X1,X2)
| ~ class(X7,X1,X0)
| ~ organization(X7,X0)
| ~ inertia(X7,X3,X0)
| ~ size(X7,X4,X0)
| ~ inertia(X5,X6,X2)
| ~ size(X5,X8,X2)
| ~ organization(X5,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X8,X0,X2,X4,X1,X7,X3,X5,X6] :
( ( greater(X4,X8)
& class(X5,X1,X2)
& class(X7,X1,X0)
& organization(X7,X0)
& inertia(X7,X3,X0)
& size(X7,X4,X0)
& inertia(X5,X6,X2)
& size(X5,X8,X2)
& organization(X5,X2) )
=> greater(X3,X6) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X5,X10,X4,X9,X12,X0,X8,X3,X11] :
( ( inertia(X3,X9,X5)
& organization(X3,X5)
& greater(X12,X11)
& class(X0,X10,X4)
& inertia(X0,X8,X4)
& size(X3,X12,X5)
& organization(X0,X4)
& size(X0,X11,X4)
& class(X3,X10,X5) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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 : n024.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 03:14:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (19004)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (18996)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.54 % (19012)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.54 % (18997)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.54 % (18996)First to succeed.
% 0.20/0.55 % (18996)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 % (18996)------------------------------
% 0.20/0.55 % (18996)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (18996)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (18996)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (18996)Memory used [KB]: 6012
% 0.20/0.55 % (18996)Time elapsed: 0.116 s
% 0.20/0.55 % (18996)Instructions burned: 5 (million)
% 0.20/0.55 % (18996)------------------------------
% 0.20/0.55 % (18996)------------------------------
% 0.20/0.55 % (18989)Success in time 0.189 s
%------------------------------------------------------------------------------