TSTP Solution File: MGT009+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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 : Tue May 21 00:42:03 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 71 ( 16 unt; 0 def)
% Number of atoms : 368 ( 0 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 489 ( 192 ~; 164 |; 116 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 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 : 213 ( 183 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f194,plain,
$false,
inference(avatar_sat_refutation,[],[f136,f157,f170,f193]) ).
fof(f193,plain,
( ~ spl10_12
| ~ spl10_13 ),
inference(avatar_contradiction_clause,[],[f192]) ).
fof(f192,plain,
( $false
| ~ spl10_12
| ~ spl10_13 ),
inference(subsumption_resolution,[],[f191,f28]) ).
fof(f28,plain,
class(sK0,sK2,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ~ greater(sK4,sK3)
& greater(sK6,sK5)
& size(sK1,sK6,sK8)
& size(sK0,sK5,sK7)
& reproducibility(sK1,sK4,sK8)
& reproducibility(sK0,sK3,sK7)
& class(sK1,sK2,sK8)
& class(sK0,sK2,sK7)
& reorganization_free(sK1,sK8,sK8)
& reorganization_free(sK0,sK7,sK7)
& organization(sK1,sK8)
& organization(sK0,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f14,f17]) ).
fof(f17,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> ( ~ greater(sK4,sK3)
& greater(sK6,sK5)
& size(sK1,sK6,sK8)
& size(sK0,sK5,sK7)
& reproducibility(sK1,sK4,sK8)
& reproducibility(sK0,sK3,sK7)
& class(sK1,sK2,sK8)
& class(sK0,sK2,sK7)
& reorganization_free(sK1,sK8,sK8)
& reorganization_free(sK0,sK7,sK7)
& organization(sK1,sK8)
& organization(sK0,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X4,X3) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X3,X10,X6,X7,X11,X12,X4,X5] :
( ( greater(X12,X11)
& size(X3,X12,X5)
& size(X0,X11,X4)
& reproducibility(X3,X7,X5)
& reproducibility(X0,X6,X4)
& class(X3,X10,X5)
& class(X0,X10,X4)
& reorganization_free(X3,X5,X5)
& reorganization_free(X0,X4,X4)
& organization(X3,X5)
& organization(X0,X4) )
=> greater(X7,X6) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X3,X10,X6,X7,X11,X12,X4,X5] :
( ( greater(X12,X11)
& size(X3,X12,X5)
& size(X0,X11,X4)
& reproducibility(X3,X7,X5)
& reproducibility(X0,X6,X4)
& class(X3,X10,X5)
& class(X0,X10,X4)
& reorganization_free(X3,X5,X5)
& reorganization_free(X0,X4,X4)
& organization(X3,X5)
& organization(X0,X4) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL) ).
fof(f191,plain,
( ~ class(sK0,sK2,sK7)
| ~ spl10_12
| ~ spl10_13 ),
inference(resolution,[],[f187,f29]) ).
fof(f29,plain,
class(sK1,sK2,sK8),
inference(cnf_transformation,[],[f18]) ).
fof(f187,plain,
( ! [X0] :
( ~ class(sK1,X0,sK8)
| ~ class(sK0,X0,sK7) )
| ~ spl10_12
| ~ spl10_13 ),
inference(subsumption_resolution,[],[f186,f140]) ).
fof(f140,plain,
( inertia(sK0,sK9(sK0,sK7),sK7)
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f139,plain,
( spl10_13
<=> inertia(sK0,sK9(sK0,sK7),sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).
fof(f186,plain,
( ! [X0] :
( ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ inertia(sK0,sK9(sK0,sK7),sK7) )
| ~ spl10_12 ),
inference(subsumption_resolution,[],[f185,f34]) ).
fof(f34,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f18]) ).
fof(f185,plain,
( ! [X0] :
( ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ greater(sK6,sK5)
| ~ inertia(sK0,sK9(sK0,sK7),sK7) )
| ~ spl10_12 ),
inference(subsumption_resolution,[],[f182,f24]) ).
fof(f24,plain,
organization(sK0,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f182,plain,
( ! [X0] :
( ~ organization(sK0,sK7)
| ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ greater(sK6,sK5)
| ~ inertia(sK0,sK9(sK0,sK7),sK7) )
| ~ spl10_12 ),
inference(resolution,[],[f135,f32]) ).
fof(f32,plain,
size(sK0,sK5,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f135,plain,
( ! [X2,X3,X0,X1] :
( ~ size(X0,X1,X2)
| ~ organization(X0,X2)
| ~ class(X0,X3,X2)
| ~ class(sK1,X3,sK8)
| ~ greater(sK6,X1)
| ~ inertia(X0,sK9(sK0,sK7),X2) )
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f134,plain,
( spl10_12
<=> ! [X0,X3,X2,X1] :
( ~ size(X0,X1,X2)
| ~ organization(X0,X2)
| ~ class(X0,X3,X2)
| ~ class(sK1,X3,sK8)
| ~ greater(sK6,X1)
| ~ inertia(X0,sK9(sK0,sK7),X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_12])]) ).
fof(f170,plain,
spl10_13,
inference(avatar_contradiction_clause,[],[f169]) ).
fof(f169,plain,
( $false
| spl10_13 ),
inference(subsumption_resolution,[],[f168,f24]) ).
fof(f168,plain,
( ~ organization(sK0,sK7)
| spl10_13 ),
inference(resolution,[],[f141,f36]) ).
fof(f36,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f15,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
=> inertia(X0,sK9(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f141,plain,
( ~ inertia(sK0,sK9(sK0,sK7),sK7)
| spl10_13 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f157,plain,
spl10_11,
inference(avatar_contradiction_clause,[],[f156]) ).
fof(f156,plain,
( $false
| spl10_11 ),
inference(subsumption_resolution,[],[f155,f25]) ).
fof(f25,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f18]) ).
fof(f155,plain,
( ~ organization(sK1,sK8)
| spl10_11 ),
inference(resolution,[],[f132,f36]) ).
fof(f132,plain,
( ~ inertia(sK1,sK9(sK1,sK8),sK8)
| spl10_11 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f130,plain,
( spl10_11
<=> inertia(sK1,sK9(sK1,sK8),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
fof(f136,plain,
( ~ spl10_11
| spl10_12 ),
inference(avatar_split_clause,[],[f128,f134,f130]) ).
fof(f128,plain,
! [X2,X3,X0,X1] :
( ~ size(X0,X1,X2)
| ~ inertia(X0,sK9(sK0,sK7),X2)
| ~ greater(sK6,X1)
| ~ inertia(sK1,sK9(sK1,sK8),sK8)
| ~ class(sK1,X3,sK8)
| ~ class(X0,X3,X2)
| ~ organization(X0,X2) ),
inference(subsumption_resolution,[],[f114,f25]) ).
fof(f114,plain,
! [X2,X3,X0,X1] :
( ~ size(X0,X1,X2)
| ~ inertia(X0,sK9(sK0,sK7),X2)
| ~ greater(sK6,X1)
| ~ inertia(sK1,sK9(sK1,sK8),sK8)
| ~ class(sK1,X3,sK8)
| ~ class(X0,X3,X2)
| ~ organization(sK1,sK8)
| ~ organization(X0,X2) ),
inference(resolution,[],[f110,f33]) ).
fof(f33,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f18]) ).
fof(f110,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ size(X2,X0,X3)
| ~ size(X4,X1,X5)
| ~ inertia(X4,sK9(sK0,sK7),X5)
| ~ greater(X0,X1)
| ~ inertia(X2,sK9(sK1,sK8),X3)
| ~ class(X2,X6,X3)
| ~ class(X4,X6,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) ),
inference(resolution,[],[f107,f23]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X4,X3)
& inertia(X1,X6,X8)
& inertia(X0,X5,X7)
& size(X1,X4,X8)
& size(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X6,X5) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X3,X10,X11,X12,X8,X9,X4,X5] :
( ( greater(X12,X11)
& inertia(X3,X9,X5)
& inertia(X0,X8,X4)
& size(X3,X12,X5)
& size(X0,X11,X4)
& class(X3,X10,X5)
& class(X0,X10,X4)
& organization(X3,X5)
& organization(X0,X4) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL) ).
fof(f107,plain,
~ greater(sK9(sK1,sK8),sK9(sK0,sK7)),
inference(subsumption_resolution,[],[f106,f24]) ).
fof(f106,plain,
( ~ greater(sK9(sK1,sK8),sK9(sK0,sK7))
| ~ organization(sK0,sK7) ),
inference(resolution,[],[f104,f36]) ).
fof(f104,plain,
! [X0] :
( ~ inertia(sK0,X0,sK7)
| ~ greater(sK9(sK1,sK8),X0) ),
inference(subsumption_resolution,[],[f103,f25]) ).
fof(f103,plain,
! [X0] :
( ~ greater(sK9(sK1,sK8),X0)
| ~ inertia(sK0,X0,sK7)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f102,f36]) ).
fof(f102,plain,
! [X0,X1] :
( ~ inertia(sK1,X1,sK8)
| ~ greater(X1,X0)
| ~ inertia(sK0,X0,sK7) ),
inference(subsumption_resolution,[],[f101,f24]) ).
fof(f101,plain,
! [X0,X1] :
( ~ inertia(sK0,X0,sK7)
| ~ greater(X1,X0)
| ~ inertia(sK1,X1,sK8)
| ~ organization(sK0,sK7) ),
inference(subsumption_resolution,[],[f100,f26]) ).
fof(f26,plain,
reorganization_free(sK0,sK7,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f100,plain,
! [X0,X1] :
( ~ inertia(sK0,X0,sK7)
| ~ greater(X1,X0)
| ~ inertia(sK1,X1,sK8)
| ~ reorganization_free(sK0,sK7,sK7)
| ~ organization(sK0,sK7) ),
inference(resolution,[],[f89,f30]) ).
fof(f30,plain,
reproducibility(sK0,sK3,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f89,plain,
! [X2,X3,X0,X1] :
( ~ reproducibility(X0,sK3,X1)
| ~ inertia(X0,X2,X1)
| ~ greater(X3,X2)
| ~ inertia(sK1,X3,sK8)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(subsumption_resolution,[],[f88,f25]) ).
fof(f88,plain,
! [X2,X3,X0,X1] :
( ~ reproducibility(X0,sK3,X1)
| ~ inertia(X0,X2,X1)
| ~ greater(X3,X2)
| ~ inertia(sK1,X3,sK8)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(sK1,sK8)
| ~ organization(X0,X1) ),
inference(subsumption_resolution,[],[f86,f27]) ).
fof(f27,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f18]) ).
fof(f86,plain,
! [X2,X3,X0,X1] :
( ~ reproducibility(X0,sK3,X1)
| ~ inertia(X0,X2,X1)
| ~ greater(X3,X2)
| ~ inertia(sK1,X3,sK8)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(sK1,sK8)
| ~ organization(X0,X1) ),
inference(resolution,[],[f38,f31]) ).
fof(f31,plain,
reproducibility(sK1,sK4,sK8),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reproducibility(X2,sK4,X3)
| ~ reproducibility(X4,sK3,X5)
| ~ inertia(X4,X1,X5)
| ~ greater(X0,X1)
| ~ inertia(X2,X0,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) ),
inference(resolution,[],[f22,f35]) ).
fof(f35,plain,
~ greater(sK4,sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X5,X4)
| ~ greater(X7,X6)
| ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( ( greater(X5,X4)
| ~ greater(X7,X6) )
& ( greater(X7,X6)
| ~ greater(X5,X4) ) )
| ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( inertia(X1,X7,X3)
& inertia(X0,X6,X2)
& reproducibility(X1,X5,X3)
& reproducibility(X0,X4,X2)
& reorganization_free(X1,X3,X3)
& reorganization_free(X0,X2,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X3,X4,X5,X6,X7,X8,X9] :
( ( inertia(X3,X9,X5)
& inertia(X0,X8,X4)
& reproducibility(X3,X7,X5)
& reproducibility(X0,X6,X4)
& reorganization_free(X3,X5,X5)
& reorganization_free(X0,X4,X4)
& organization(X3,X5)
& organization(X0,X4) )
=> ( greater(X7,X6)
<=> greater(X9,X8) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 00:01:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.74 % (20199)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.57/0.74 % (20192)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.57/0.74 % (20194)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.74 % (20196)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.57/0.74 % (20195)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.57/0.74 % (20193)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.57/0.74 % (20197)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.57/0.74 % (20198)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.57/0.74 % (20199)First to succeed.
% 0.57/0.74 % (20195)Also succeeded, but the first one will report.
% 0.57/0.74 % (20199)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20191"
% 0.57/0.75 % (20194)Also succeeded, but the first one will report.
% 0.57/0.75 % (20199)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for theBenchmark
% 0.57/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75 % (20199)------------------------------
% 0.57/0.75 % (20199)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (20199)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (20199)Memory used [KB]: 1093
% 0.57/0.75 % (20199)Time elapsed: 0.005 s
% 0.57/0.75 % (20199)Instructions burned: 10 (million)
% 0.57/0.75 % (20191)Success in time 0.387 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------