TSTP Solution File: SET720+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET720+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 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 : n021.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:25:27 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 12 unt; 0 def)
% Number of atoms : 257 ( 25 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 284 ( 87 ~; 81 |; 83 &)
% ( 8 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 205 ( 174 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f258,plain,
$false,
inference(subsumption_resolution,[],[f257,f193]) ).
fof(f193,plain,
~ equal_maps(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10,sK11),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
( ~ equal_maps(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10,sK11)
& one_to_one(sK12,sK10,sK11)
& maps(sK12,sK10,sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f127,f128]) ).
fof(f128,plain,
( ? [X0,X1,X2] :
( ~ equal_maps(inverse_function(inverse_function(X2,X0,X1),X1,X0),X2,X0,X1)
& one_to_one(X2,X0,X1)
& maps(X2,X0,X1) )
=> ( ~ equal_maps(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10,sK11)
& one_to_one(sK12,sK10,sK11)
& maps(sK12,sK10,sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0,X1,X2] :
( ~ equal_maps(inverse_function(inverse_function(X2,X0,X1),X1,X0),X2,X0,X1)
& one_to_one(X2,X0,X1)
& maps(X2,X0,X1) ),
inference(rectify,[],[f66]) ).
fof(f66,plain,
? [X1,X2,X0] :
( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
& one_to_one(X0,X1,X2)
& maps(X0,X1,X2) ),
inference(flattening,[],[f65]) ).
fof(f65,plain,
? [X1,X0,X2] :
( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
& maps(X0,X1,X2)
& one_to_one(X0,X1,X2) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
~ ! [X1,X0,X2] :
( ( maps(X0,X1,X2)
& one_to_one(X0,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2) ),
inference(rectify,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X5,X0,X1] :
( ( maps(X5,X0,X1)
& one_to_one(X5,X0,X1) )
=> equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X5,X0,X1] :
( ( maps(X5,X0,X1)
& one_to_one(X5,X0,X1) )
=> equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII11) ).
fof(f257,plain,
equal_maps(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10,sK11),
inference(trivial_inequality_removal,[],[f256]) ).
fof(f256,plain,
( sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10) != sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)
| equal_maps(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10,sK11) ),
inference(superposition,[],[f174,f247]) ).
fof(f247,plain,
sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10) = sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),
inference(subsumption_resolution,[],[f246,f211]) ).
fof(f211,plain,
member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11),
inference(resolution,[],[f176,f193]) ).
fof(f176,plain,
! [X2,X3,X0,X1] :
( equal_maps(X1,X2,X3,X0)
| member(sK4(X0,X1,X2,X3),X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0,X1,X2,X3] :
( ( apply(X2,sK6(X0,X1,X2,X3),sK5(X0,X1,X2,X3))
& member(sK6(X0,X1,X2,X3),X3)
& member(sK4(X0,X1,X2,X3),X0)
& apply(X1,sK6(X0,X1,X2,X3),sK4(X0,X1,X2,X3))
& sK5(X0,X1,X2,X3) != sK4(X0,X1,X2,X3)
& member(sK5(X0,X1,X2,X3),X0) )
| equal_maps(X1,X2,X3,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f110,f111]) ).
fof(f111,plain,
! [X0,X1,X2,X3] :
( ? [X4,X5,X6] :
( apply(X2,X6,X5)
& member(X6,X3)
& member(X4,X0)
& apply(X1,X6,X4)
& X4 != X5
& member(X5,X0) )
=> ( apply(X2,sK6(X0,X1,X2,X3),sK5(X0,X1,X2,X3))
& member(sK6(X0,X1,X2,X3),X3)
& member(sK4(X0,X1,X2,X3),X0)
& apply(X1,sK6(X0,X1,X2,X3),sK4(X0,X1,X2,X3))
& sK5(X0,X1,X2,X3) != sK4(X0,X1,X2,X3)
& member(sK5(X0,X1,X2,X3),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
! [X0,X1,X2,X3] :
( ? [X4,X5,X6] :
( apply(X2,X6,X5)
& member(X6,X3)
& member(X4,X0)
& apply(X1,X6,X4)
& X4 != X5
& member(X5,X0) )
| equal_maps(X1,X2,X3,X0) ),
inference(rectify,[],[f71]) ).
fof(f71,plain,
! [X3,X1,X2,X0] :
( ? [X4,X6,X5] :
( apply(X2,X5,X6)
& member(X5,X0)
& member(X4,X3)
& apply(X1,X5,X4)
& X4 != X6
& member(X6,X3) )
| equal_maps(X1,X2,X0,X3) ),
inference(flattening,[],[f70]) ).
fof(f70,plain,
! [X2,X1,X3,X0] :
( equal_maps(X1,X2,X0,X3)
| ? [X6,X4,X5] :
( X4 != X6
& apply(X2,X5,X6)
& apply(X1,X5,X4)
& member(X5,X0)
& member(X6,X3)
& member(X4,X3) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
! [X2,X1,X3,X0] :
( ! [X6,X4,X5] :
( ( member(X5,X0)
& member(X6,X3)
& member(X4,X3) )
=> ( ( apply(X2,X5,X6)
& apply(X1,X5,X4) )
=> X4 = X6 ) )
=> equal_maps(X1,X2,X0,X3) ),
inference(unused_predicate_definition_removal,[],[f52]) ).
fof(f52,plain,
! [X2,X1,X3,X0] :
( ! [X6,X4,X5] :
( ( member(X5,X0)
& member(X6,X3)
& member(X4,X3) )
=> ( ( apply(X2,X5,X6)
& apply(X1,X5,X4) )
=> X4 = X6 ) )
<=> equal_maps(X1,X2,X0,X3) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X0,X5,X9,X1] :
( ! [X6,X2,X7] :
( ( member(X7,X1)
& member(X2,X0)
& member(X6,X1) )
=> ( ( apply(X9,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) )
<=> equal_maps(X5,X9,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_maps) ).
fof(f246,plain,
( sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10) = sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)
| ~ member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11) ),
inference(resolution,[],[f234,f229]) ).
fof(f229,plain,
apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)),
inference(subsumption_resolution,[],[f228,f211]) ).
fof(f228,plain,
( apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10))
| ~ member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11) ),
inference(subsumption_resolution,[],[f226,f212]) ).
fof(f212,plain,
member(sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK10),
inference(resolution,[],[f177,f193]) ).
fof(f177,plain,
! [X2,X3,X0,X1] :
( equal_maps(X1,X2,X3,X0)
| member(sK6(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f112]) ).
fof(f226,plain,
( apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10))
| ~ member(sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK10)
| ~ member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11) ),
inference(resolution,[],[f225,f167]) ).
fof(f167,plain,
! [X2,X3,X0,X1,X4] :
( ~ apply(inverse_function(X2,X3,X4),X0,X1)
| apply(X2,X1,X0)
| ~ member(X1,X3)
| ~ member(X0,X4) ),
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0,X1,X2,X3,X4] :
( ~ member(X0,X4)
| ( ( apply(inverse_function(X2,X3,X4),X0,X1)
| ~ apply(X2,X1,X0) )
& ( apply(X2,X1,X0)
| ~ apply(inverse_function(X2,X3,X4),X0,X1) ) )
| ~ member(X1,X3) ),
inference(rectify,[],[f103]) ).
fof(f103,plain,
! [X3,X0,X1,X4,X2] :
( ~ member(X3,X2)
| ( ( apply(inverse_function(X1,X4,X2),X3,X0)
| ~ apply(X1,X0,X3) )
& ( apply(X1,X0,X3)
| ~ apply(inverse_function(X1,X4,X2),X3,X0) ) )
| ~ member(X0,X4) ),
inference(nnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X3,X0,X1,X4,X2] :
( ~ member(X3,X2)
| ( apply(inverse_function(X1,X4,X2),X3,X0)
<=> apply(X1,X0,X3) )
| ~ member(X0,X4) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X2,X3,X0,X1,X4] :
( ( apply(inverse_function(X1,X4,X2),X3,X0)
<=> apply(X1,X0,X3) )
| ~ member(X0,X4)
| ~ member(X3,X2) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
! [X2,X3,X0,X1,X4] :
( ( member(X0,X4)
& member(X3,X2) )
=> ( apply(inverse_function(X1,X4,X2),X3,X0)
<=> apply(X1,X0,X3) ) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X2,X5,X1,X4,X0] :
( ( member(X4,X1)
& member(X2,X0) )
=> ( apply(X5,X2,X4)
<=> apply(inverse_function(X5,X0,X1),X4,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_function) ).
fof(f225,plain,
apply(inverse_function(sK12,sK10,sK11),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)),
inference(subsumption_resolution,[],[f224,f211]) ).
fof(f224,plain,
( ~ member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11)
| apply(inverse_function(sK12,sK10,sK11),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)) ),
inference(subsumption_resolution,[],[f222,f212]) ).
fof(f222,plain,
( apply(inverse_function(sK12,sK10,sK11),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10))
| ~ member(sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK10)
| ~ member(sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11) ),
inference(resolution,[],[f217,f167]) ).
fof(f217,plain,
apply(inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK4(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)),
inference(resolution,[],[f175,f193]) ).
fof(f175,plain,
! [X2,X3,X0,X1] :
( equal_maps(X1,X2,X3,X0)
| apply(X1,sK6(X0,X1,X2,X3),sK4(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f234,plain,
! [X1] :
( ~ apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),X1)
| ~ member(X1,sK11)
| sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10) = X1 ),
inference(subsumption_resolution,[],[f232,f210]) ).
fof(f210,plain,
member(sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11),
inference(resolution,[],[f173,f193]) ).
fof(f173,plain,
! [X2,X3,X0,X1] :
( equal_maps(X1,X2,X3,X0)
| member(sK5(X0,X1,X2,X3),X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f232,plain,
! [X1] :
( sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10) = X1
| ~ member(X1,sK11)
| ~ member(sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK11)
| ~ apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),X1) ),
inference(resolution,[],[f221,f218]) ).
fof(f218,plain,
apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),sK5(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10)),
inference(resolution,[],[f178,f193]) ).
fof(f178,plain,
! [X2,X3,X0,X1] :
( equal_maps(X1,X2,X3,X0)
| apply(X2,sK6(X0,X1,X2,X3),sK5(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f221,plain,
! [X0,X1] :
( ~ apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),X0)
| ~ member(X1,sK11)
| ~ apply(sK12,sK6(sK11,inverse_function(inverse_function(sK12,sK10,sK11),sK11,sK10),sK12,sK10),X1)
| ~ member(X0,sK11)
| X0 = X1 ),
inference(resolution,[],[f220,f212]) ).
fof(f220,plain,
! [X2,X0,X1] :
( ~ member(X0,sK10)
| X1 = X2
| ~ apply(sK12,X0,X2)
| ~ member(X1,sK11)
| ~ member(X2,sK11)
| ~ apply(sK12,X0,X1) ),
inference(resolution,[],[f160,f191]) ).
fof(f191,plain,
maps(sK12,sK10,sK11),
inference(cnf_transformation,[],[f129]) ).
fof(f160,plain,
! [X2,X0,X1,X6,X7,X5] :
( ~ maps(X2,X0,X1)
| ~ member(X7,X0)
| ~ apply(X2,X7,X5)
| X5 = X6
| ~ apply(X2,X7,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X0)
| ( apply(X2,X3,sK1(X1,X2,X3))
& member(sK1(X1,X2,X3),X1) ) )
& ! [X5,X6,X7] :
( ~ member(X7,X0)
| ~ apply(X2,X7,X5)
| ~ member(X5,X1)
| X5 = X6
| ~ apply(X2,X7,X6)
| ~ member(X6,X1) ) )
| ~ maps(X2,X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f95,f96]) ).
fof(f96,plain,
! [X1,X2,X3] :
( ? [X4] :
( apply(X2,X3,X4)
& member(X4,X1) )
=> ( apply(X2,X3,sK1(X1,X2,X3))
& member(sK1(X1,X2,X3),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X0)
| ? [X4] :
( apply(X2,X3,X4)
& member(X4,X1) ) )
& ! [X5,X6,X7] :
( ~ member(X7,X0)
| ~ apply(X2,X7,X5)
| ~ member(X5,X1)
| X5 = X6
| ~ apply(X2,X7,X6)
| ~ member(X6,X1) ) )
| ~ maps(X2,X0,X1) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
! [X1,X0,X2] :
( ( ! [X3] :
( ~ member(X3,X1)
| ? [X4] :
( apply(X2,X3,X4)
& member(X4,X0) ) )
& ! [X6,X7,X5] :
( ~ member(X5,X1)
| ~ apply(X2,X5,X6)
| ~ member(X6,X0)
| X6 = X7
| ~ apply(X2,X5,X7)
| ~ member(X7,X0) ) )
| ~ maps(X2,X1,X0) ),
inference(flattening,[],[f75]) ).
fof(f75,plain,
! [X0,X2,X1] :
( ( ! [X7,X6,X5] :
( X6 = X7
| ~ apply(X2,X5,X7)
| ~ apply(X2,X5,X6)
| ~ member(X5,X1)
| ~ member(X7,X0)
| ~ member(X6,X0) )
& ! [X3] :
( ~ member(X3,X1)
| ? [X4] :
( apply(X2,X3,X4)
& member(X4,X0) ) ) )
| ~ maps(X2,X1,X0) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X2,X1] :
( maps(X2,X1,X0)
=> ( ! [X7,X6,X5] :
( ( member(X5,X1)
& member(X7,X0)
& member(X6,X0) )
=> ( ( apply(X2,X5,X7)
& apply(X2,X5,X6) )
=> X6 = X7 ) )
& ! [X3] :
( member(X3,X1)
=> ? [X4] :
( apply(X2,X3,X4)
& member(X4,X0) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f53,plain,
! [X0,X2,X1] :
( maps(X2,X1,X0)
<=> ( ! [X7,X6,X5] :
( ( member(X5,X1)
& member(X7,X0)
& member(X6,X0) )
=> ( ( apply(X2,X5,X7)
& apply(X2,X5,X6) )
=> X6 = X7 ) )
& ! [X3] :
( member(X3,X1)
=> ? [X4] :
( apply(X2,X3,X4)
& member(X4,X0) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X1,X0,X5] :
( maps(X5,X0,X1)
<=> ( ! [X2] :
( member(X2,X0)
=> ? [X4] :
( apply(X5,X2,X4)
& member(X4,X1) ) )
& ! [X2,X6,X7] :
( ( member(X2,X0)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X5,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maps) ).
fof(f174,plain,
! [X2,X3,X0,X1] :
( sK5(X0,X1,X2,X3) != sK4(X0,X1,X2,X3)
| equal_maps(X1,X2,X3,X0) ),
inference(cnf_transformation,[],[f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET720+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 0.03/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 14:11:26 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.47 % (11532)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.47 % (11553)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.18/0.47 % (11545)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.18/0.48 % (11552)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.18/0.48 % (11535)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.48 % (11553)First to succeed.
% 0.18/0.48 % (11536)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.49 % (11544)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.49 % (11553)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (11553)------------------------------
% 0.18/0.49 % (11553)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (11553)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (11553)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (11553)Memory used [KB]: 5628
% 0.18/0.49 % (11553)Time elapsed: 0.079 s
% 0.18/0.49 % (11553)Instructions burned: 8 (million)
% 0.18/0.49 % (11553)------------------------------
% 0.18/0.49 % (11553)------------------------------
% 0.18/0.49 % (11526)Success in time 0.157 s
%------------------------------------------------------------------------------