TSTP Solution File: SEV189^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV189^5 : TPTP v8.2.0. Released v4.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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 04:12:19 EDT 2024
% Result : Theorem 0.16s 0.34s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 48 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 435 ( 109 equ; 0 cnn)
% Maximal formula atoms : 11 ( 10 avg)
% Number of connectives : 580 ( 53 ~; 46 |; 41 &; 320 @)
% ( 2 <=>; 84 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 182 ( 182 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 5 con; 0-2 aty)
% ( 34 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 151 ( 80 ^ 61 !; 9 ?; 151 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
cQ: ( b > $o ) > $o ).
thf(func_def_2,type,
cP: ( b > $o ) > $o ).
thf(func_def_11,type,
sK0: ( ( b > $o ) > $o ) > b > $o ).
thf(func_def_12,type,
sK1: ( ( b > $o ) > $o ) > b > $o ).
thf(func_def_13,type,
sK2: ( b > $o ) > $o ).
thf(func_def_16,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f49,plain,
$false,
inference(avatar_sat_refutation,[],[f28,f38,f48]) ).
thf(f48,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f47]) ).
thf(f47,plain,
( $false
| spl3_2 ),
inference(subsumption_resolution,[],[f46,f42]) ).
thf(f42,plain,
( ( $true
= ( sK2 @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
( ( $true != $true )
| ( $true
= ( sK2 @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(superposition,[],[f27,f16]) ).
thf(f16,plain,
! [X2: ( b > $o ) > $o] :
( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
= ( X2 @ ( sK1 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X0: ( b > $o ) > $o] :
( ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( ( $true
= ( X0 @ ( sK0 @ X0 ) ) )
& ( ( cP @ ( sK0 @ X0 ) )
!= $true ) ) )
& ! [X2: ( b > $o ) > $o] :
( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( ( ( cQ @ ( sK1 @ X2 ) )
!= $true )
& ( $true
= ( X2 @ ( sK1 @ X2 ) ) ) ) )
& ( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X5: b > $o] :
( ( $true
!= ( sK2 @ X5 ) )
| ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9]) ).
thf(f9,plain,
! [X0: ( b > $o ) > $o] :
( ? [X1: b > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cP @ X1 )
!= $true ) )
=> ( ( $true
= ( X0 @ ( sK0 @ X0 ) ) )
& ( ( cP @ ( sK0 @ X0 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: ( b > $o ) > $o] :
( ? [X3: b > $o] :
( ( $true
!= ( cQ @ X3 ) )
& ( $true
= ( X2 @ X3 ) ) )
=> ( ( ( cQ @ ( sK1 @ X2 ) )
!= $true )
& ( $true
= ( X2 @ ( sK1 @ X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: ( b > $o ) > $o] :
( ( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X5: b > $o] :
( ( $true
!= ( X4 @ X5 ) )
| ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ) )
=> ( ( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X5: b > $o] :
( ( $true
!= ( sK2 @ X5 ) )
| ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: ( b > $o ) > $o] :
( ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ? [X1: b > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cP @ X1 )
!= $true ) ) )
& ! [X2: ( b > $o ) > $o] :
( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ? [X3: b > $o] :
( ( $true
!= ( cQ @ X3 ) )
& ( $true
= ( X2 @ X3 ) ) ) )
& ? [X4: ( b > $o ) > $o] :
( ( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X5: b > $o] :
( ( $true
!= ( X4 @ X5 ) )
| ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X4: ( b > $o ) > $o] :
( ( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X5: b > $o] :
( ( $true
!= ( X4 @ X5 ) )
| ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ) )
& ! [X2: ( b > $o ) > $o] :
( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ? [X3: b > $o] :
( ( $true
!= ( cQ @ X3 ) )
& ( $true
= ( X2 @ X3 ) ) ) )
& ! [X0: ( b > $o ) > $o] :
( ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ? [X1: b > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cP @ X1 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ! [X2: ( b > $o ) > $o] :
( ! [X3: b > $o] :
( ( $true
= ( X2 @ X3 ) )
=> ( $true
= ( cQ @ X3 ) ) )
=> ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cP @ X1 )
= $true ) )
=> ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ) )
=> ! [X4: ( b > $o ) > $o] :
( ! [X5: b > $o] :
( ( $true
= ( X4 @ X5 ) )
=> ( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) )
=> ( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
& ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cP @ X1 )
= $true ) )
=> ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) )
& ! [X4: ( b > $o ) > $o] :
( ! [X5: b > $o] :
( ( $true
= ( X4 @ X5 ) )
=> ( ( cQ @ X5 )
= $true ) )
=> ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X4 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ) )
=> ! [X8: ( b > $o ) > $o] :
( ! [X9: b > $o] :
( ( $true
= ( X8 @ X9 ) )
=> ( ( ( cQ @ X9 )
= $true )
& ( $true
= ( cP @ X9 ) ) ) )
=> ( ( ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X8 @ Y1 )
=> ( Y1 @ Y0 ) ) ) )
= $true )
& ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X8 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
=> ( cP
@ ^ [X2: b] :
! [X3: b > $o] :
( ( X0 @ X3 )
=> ( X3 @ X2 ) ) ) )
& ! [X4: ( b > $o ) > $o] :
( ! [X5: b > $o] :
( ( X4 @ X5 )
=> ( cQ @ X5 ) )
=> ( cQ
@ ^ [X6: b] :
! [X7: b > $o] :
( ( X4 @ X7 )
=> ( X7 @ X6 ) ) ) ) )
=> ! [X8: ( b > $o ) > $o] :
( ! [X9: b > $o] :
( ( X8 @ X9 )
=> ( ( cQ @ X9 )
& ( cP @ X9 ) ) )
=> ( ( cQ
@ ^ [X10: b] :
! [X11: b > $o] :
( ( X8 @ X11 )
=> ( X11 @ X10 ) ) )
& ( cP
@ ^ [X12: b] :
! [X13: b > $o] :
( ( X8 @ X13 )
=> ( X13 @ X12 ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
=> ( cP
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) )
& ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( cQ @ X1 ) )
=> ( cQ
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) ) )
=> ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( ( cQ @ X1 )
& ( cP @ X1 ) ) )
=> ( ( cQ
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) )
& ( cP
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( cP @ X1 ) )
=> ( cP
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) )
& ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( cQ @ X1 ) )
=> ( cQ
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) ) )
=> ! [X0: ( b > $o ) > $o] :
( ! [X1: b > $o] :
( ( X0 @ X1 )
=> ( ( cQ @ X1 )
& ( cP @ X1 ) ) )
=> ( ( cQ
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) )
& ( cP
@ ^ [X1: b] :
! [X2: b > $o] :
( ( X0 @ X2 )
=> ( X2 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM567_pme) ).
thf(f27,plain,
( ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| spl3_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl3_2
<=> ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f46,plain,
( ( $true
!= ( sK2 @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ( $true != $true )
| ( $true
!= ( sK2 @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(superposition,[],[f44,f13]) ).
thf(f13,plain,
! [X5: b > $o] :
( ( ( cQ @ X5 )
= $true )
| ( $true
!= ( sK2 @ X5 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f44,plain,
( ( $true
!= ( cQ @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f40,plain,
( ( $true != $true )
| ( $true
!= ( cQ @ ( sK1 @ sK2 ) ) )
| spl3_2 ),
inference(superposition,[],[f27,f17]) ).
thf(f17,plain,
! [X2: ( b > $o ) > $o] :
( ( $true
= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( ( cQ @ ( sK1 @ X2 ) )
!= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f38,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f37]) ).
thf(f37,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f36,f34]) ).
thf(f34,plain,
( ( $true
= ( sK2 @ ( sK0 @ sK2 ) ) )
| spl3_1 ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f33,plain,
( ( $true
= ( sK2 @ ( sK0 @ sK2 ) ) )
| ( $true != $true )
| spl3_1 ),
inference(superposition,[],[f23,f19]) ).
thf(f19,plain,
! [X0: ( b > $o ) > $o] :
( ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
= ( X0 @ ( sK0 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f23,plain,
( ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| spl3_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f21,plain,
( spl3_1
<=> ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f36,plain,
( ( $true
!= ( sK2 @ ( sK0 @ sK2 ) ) )
| spl3_1 ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $true != $true )
| ( $true
!= ( sK2 @ ( sK0 @ sK2 ) ) )
| spl3_1 ),
inference(superposition,[],[f32,f14]) ).
thf(f14,plain,
! [X5: b > $o] :
( ( ( cP @ X5 )
= $true )
| ( $true
!= ( sK2 @ X5 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f32,plain,
( ( $true
!= ( cP @ ( sK0 @ sK2 ) ) )
| spl3_1 ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
( ( $true != $true )
| ( $true
!= ( cP @ ( sK0 @ sK2 ) ) )
| spl3_1 ),
inference(superposition,[],[f23,f18]) ).
thf(f18,plain,
! [X0: ( b > $o ) > $o] :
( ( $true
= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( X0 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( ( cP @ ( sK0 @ X0 ) )
!= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f28,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f15,f25,f21]) ).
thf(f15,plain,
( ( $true
!= ( cP
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) )
| ( $true
!= ( cQ
@ ^ [Y0: b] :
( !! @ ( b > $o )
@ ^ [Y1: b > $o] :
( ( sK2 @ Y1 )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV189^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.31 % Computer : n014.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sun May 19 19:10:38 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.12/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.31 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % (30773)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.33 % (30770)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.16/0.33 % (30774)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.16/0.33 % (30773)Instruction limit reached!
% 0.16/0.33 % (30773)------------------------------
% 0.16/0.33 % (30773)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (30773)Termination reason: Unknown
% 0.16/0.33 % (30773)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (30773)Memory used [KB]: 895
% 0.16/0.33 % (30773)Time elapsed: 0.003 s
% 0.16/0.33 % (30773)Instructions burned: 2 (million)
% 0.16/0.33 % (30773)------------------------------
% 0.16/0.33 % (30773)------------------------------
% 0.16/0.33 % (30770)Instruction limit reached!
% 0.16/0.33 % (30770)------------------------------
% 0.16/0.33 % (30770)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (30770)Termination reason: Unknown
% 0.16/0.33 % (30770)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (30770)Memory used [KB]: 5500
% 0.16/0.33 % (30770)Time elapsed: 0.004 s
% 0.16/0.33 % (30770)Instructions burned: 4 (million)
% 0.16/0.33 % (30770)------------------------------
% 0.16/0.33 % (30770)------------------------------
% 0.16/0.34 % (30774)First to succeed.
% 0.16/0.34 % (30774)Refutation found. Thanks to Tanya!
% 0.16/0.34 % SZS status Theorem for theBenchmark
% 0.16/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.34 % (30774)------------------------------
% 0.16/0.34 % (30774)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (30774)Termination reason: Refutation
% 0.16/0.34
% 0.16/0.34 % (30774)Memory used [KB]: 5500
% 0.16/0.34 % (30774)Time elapsed: 0.008 s
% 0.16/0.34 % (30774)Instructions burned: 6 (million)
% 0.16/0.34 % (30774)------------------------------
% 0.16/0.34 % (30774)------------------------------
% 0.16/0.34 % (30764)Success in time 0.01 s
% 0.16/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------