TSTP Solution File: LCL961^11 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL961^11 : TPTP v8.2.0. Released v8.1.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 : 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 00:24:12 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 25
% Syntax : Number of formulae : 90 ( 50 unt; 18 typ; 0 def)
% Number of atoms : 431 ( 88 equ; 0 cnn)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 568 ( 27 ~; 28 |; 3 &; 413 @)
% ( 0 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 71 ( 71 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 8 con; 0-3 aty)
% ( 34 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 130 ( 95 ^ 35 !; 0 ?; 130 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mrel: mworld > mworld > $o ).
thf(func_def_2,type,
mactual: mworld ).
thf(func_def_3,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_5,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_6,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_7,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_8,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_9,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_10,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mdia: ( mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
p: mworld > $o ).
thf(func_def_13,type,
q: mworld > $o ).
thf(func_def_28,type,
sK1: mworld ).
thf(func_def_29,type,
sK2: mworld ).
thf(func_def_30,type,
sK3: mworld ).
thf(func_def_31,type,
sK4: mworld ).
thf(f204,plain,
$false,
inference(trivial_inequality_removal,[],[f203]) ).
thf(f203,plain,
$false = $true,
inference(forward_demodulation,[],[f202,f77]) ).
thf(f77,plain,
( $false
= ( q @ sK4 ) ),
inference(binary_proxy_clausification,[],[f76]) ).
thf(f76,plain,
( ( ( mrel @ sK3 @ sK4 )
=> ( q @ sK4 ) )
= $false ),
inference(beta_eta_normalization,[],[f75]) ).
thf(f75,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( q @ Y0 ) )
@ sK4 ) ),
inference(sigma_clausification,[],[f70]) ).
thf(f70,plain,
( $false
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( q @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( $false
= ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( p @ Y0 ) ) )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( q @ Y0 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( $false
= ( ( mrel @ mactual @ sK3 )
=> ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( p @ Y0 ) ) )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK3 @ Y0 )
=> ( q @ Y0 ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f66]) ).
thf(f66,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) ) ) )
@ sK3 ) ),
inference(sigma_clausification,[],[f51]) ).
thf(f51,plain,
( $false
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) ) ) )
| ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) ) ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f49]) ).
thf(f49,plain,
( $true
!= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ p )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ q ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ q )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ p ) ) ) ) ) ),
inference(definition_unfolding,[],[f46,f40,f48,f47,f38,f47,f47,f47,f38,f47,f47]) ).
thf(f38,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= mimplies ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
=> ( X3 @ X2 ) ) )
= mimplies ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).
thf(f47,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
( ( ^ [X0: mworld > $o,X1: mworld] :
! [X2: mworld] :
( ( mrel @ X1 @ X2 )
=> ( X0 @ X2 ) ) )
= mbox ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( ( ^ [X0: mworld > $o,X2: mworld] :
! [X4: mworld] :
( ( mrel @ X2 @ X4 )
=> ( X0 @ X4 ) ) )
= mbox ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(f48,plain,
( mor
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( mor
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f31]) ).
thf(f31,plain,
( mor
= ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
( mor
= ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
| ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor_def) ).
thf(f40,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( mlocal
= ( ^ [X0: mworld > $o] : ( X0 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(f46,plain,
( ( mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
( ( mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ) )
!= $true ),
inference(flattening,[],[f25]) ).
thf(f25,plain,
( ( mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ) )
!= $true ),
inference(fool_elimination,[],[f24]) ).
thf(f24,plain,
~ ( mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f12,negated_conjecture,
~ ( mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ) ),
inference(negated_conjecture,[],[f11]) ).
thf(f11,conjecture,
mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel16) ).
thf(f202,plain,
( $true
= ( q @ sK4 ) ),
inference(trivial_inequality_removal,[],[f195]) ).
thf(f195,plain,
( ( $true
= ( q @ sK4 ) )
| ( $false = $true ) ),
inference(superposition,[],[f194,f61]) ).
thf(f61,plain,
! [X1: mworld] :
( ( $false
= ( mrel @ sK1 @ X1 ) )
| ( ( q @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f60]) ).
thf(f60,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ sK1 @ X1 )
=> ( q @ X1 ) ) ),
inference(beta_eta_normalization,[],[f59]) ).
thf(f59,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( q @ Y0 ) )
@ X1 ) ),
inference(pi_clausification,[],[f58]) ).
thf(f58,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( q @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f55]) ).
thf(f55,plain,
( $false
= ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( q @ Y0 ) ) )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( p @ Y0 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f54]) ).
thf(f54,plain,
( $false
= ( ( mrel @ mactual @ sK1 )
=> ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( q @ Y0 ) ) )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( p @ Y0 ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f53]) ).
thf(f53,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) ) )
@ sK1 ) ),
inference(sigma_clausification,[],[f52]) ).
thf(f52,plain,
( $false
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( q @ Y1 ) ) )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f50]) ).
thf(f194,plain,
( $true
= ( mrel @ sK1 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f191]) ).
thf(f191,plain,
( ( $true
= ( mrel @ sK1 @ sK4 ) )
| ( $true != $true ) ),
inference(superposition,[],[f106,f190]) ).
thf(f190,plain,
( ( mrel @ sK4 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f184]) ).
thf(f184,plain,
( ( $true != $true )
| ( ( mrel @ sK4 @ sK1 )
= $true ) ),
inference(superposition,[],[f104,f182]) ).
thf(f182,plain,
( $true
= ( mrel @ mactual @ sK4 ) ),
inference(trivial_inequality_removal,[],[f179]) ).
thf(f179,plain,
( ( $true
= ( mrel @ mactual @ sK4 ) )
| ( $true != $true ) ),
inference(superposition,[],[f106,f177]) ).
thf(f177,plain,
( $true
= ( mrel @ sK4 @ mactual ) ),
inference(trivial_inequality_removal,[],[f174]) ).
thf(f174,plain,
( ( $true != $true )
| ( $true
= ( mrel @ sK4 @ mactual ) ) ),
inference(superposition,[],[f125,f78]) ).
thf(f78,plain,
( $true
= ( mrel @ sK3 @ sK4 ) ),
inference(binary_proxy_clausification,[],[f76]) ).
thf(f125,plain,
! [X0: mworld] :
( ( ( mrel @ sK3 @ X0 )
!= $true )
| ( $true
= ( mrel @ X0 @ mactual ) ) ),
inference(trivial_inequality_removal,[],[f121]) ).
thf(f121,plain,
! [X0: mworld] :
( ( ( mrel @ sK3 @ X0 )
!= $true )
| ( $true != $true )
| ( $true
= ( mrel @ X0 @ mactual ) ) ),
inference(superposition,[],[f45,f114]) ).
thf(f114,plain,
( $true
= ( mrel @ sK3 @ mactual ) ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f112,plain,
( ( $true != $true )
| ( $true
= ( mrel @ sK3 @ mactual ) ) ),
inference(superposition,[],[f106,f69]) ).
thf(f69,plain,
( $true
= ( mrel @ mactual @ sK3 ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f45,plain,
! [X2: mworld,X0: mworld,X1: mworld] :
( ( $true
!= ( mrel @ X0 @ X2 ) )
| ( $true
!= ( mrel @ X0 @ X1 ) )
| ( $true
= ( mrel @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f37,plain,
! [X0: mworld,X1: mworld,X2: mworld] :
( ( $true
!= ( mrel @ X0 @ X1 ) )
| ( $true
!= ( mrel @ X0 @ X2 ) )
| ( $true
= ( mrel @ X1 @ X2 ) ) ),
inference(flattening,[],[f36]) ).
thf(f36,plain,
! [X0: mworld,X1: mworld,X2: mworld] :
( ( $true
= ( mrel @ X1 @ X2 ) )
| ( $true
!= ( mrel @ X0 @ X2 ) )
| ( $true
!= ( mrel @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: mworld,X1: mworld,X2: mworld] :
( ( ( $true
= ( mrel @ X0 @ X2 ) )
& ( $true
= ( mrel @ X0 @ X1 ) ) )
=> ( $true
= ( mrel @ X1 @ X2 ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: mworld,X1: mworld,X2: mworld] :
( ( ( mrel @ X0 @ X1 )
& ( mrel @ X0 @ X2 ) )
=> ( mrel @ X1 @ X2 ) ),
inference(rectify,[],[f10]) ).
thf(f10,axiom,
! [X2: mworld,X5: mworld,X4: mworld] :
( ( ( mrel @ X2 @ X5 )
& ( mrel @ X2 @ X4 ) )
=> ( mrel @ X5 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_euclidean) ).
thf(f104,plain,
! [X0: mworld] :
( ( ( mrel @ mactual @ X0 )
!= $true )
| ( ( mrel @ X0 @ sK1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f98,plain,
! [X0: mworld] :
( ( ( mrel @ X0 @ sK1 )
= $true )
| ( $true != $true )
| ( ( mrel @ mactual @ X0 )
!= $true ) ),
inference(superposition,[],[f45,f56]) ).
thf(f56,plain,
( $true
= ( mrel @ mactual @ sK1 ) ),
inference(binary_proxy_clausification,[],[f54]) ).
thf(f106,plain,
! [X0: mworld,X1: mworld] :
( ( $true
!= ( mrel @ X0 @ X1 ) )
| ( ( mrel @ X1 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f95]) ).
thf(f95,plain,
! [X0: mworld,X1: mworld] :
( ( $true
!= ( mrel @ X0 @ X1 ) )
| ( $true != $true )
| ( ( mrel @ X1 @ X0 )
= $true ) ),
inference(superposition,[],[f45,f43]) ).
thf(f43,plain,
! [X0: mworld] :
( $true
= ( mrel @ X0 @ X0 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: mworld] :
( $true
= ( mrel @ X0 @ X0 ) ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
! [X0: mworld] : ( mrel @ X0 @ X0 ),
inference(rectify,[],[f9]) ).
thf(f9,axiom,
! [X2: mworld] : ( mrel @ X2 @ X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL961^11 : TPTP v8.2.0. Released v8.1.0.
% 0.10/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.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 01:58:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 % (1825)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.14/0.39 % (1826)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (1825)Refutation not found, incomplete strategy
% 0.14/0.39 % (1825)------------------------------
% 0.14/0.39 % (1825)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1825)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (1825)Memory used [KB]: 5500
% 0.14/0.39 % (1825)Time elapsed: 0.003 s
% 0.14/0.39 % (1825)Instructions burned: 3 (million)
% 0.14/0.39 % (1825)------------------------------
% 0.14/0.39 % (1825)------------------------------
% 0.14/0.39 % (1820)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.39 % (1821)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.14/0.39 % (1822)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.39 % (1823)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (1824)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.14/0.39 % (1823)Instruction limit reached!
% 0.14/0.39 % (1823)------------------------------
% 0.14/0.39 % (1823)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1827)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.39 % (1823)Termination reason: Unknown
% 0.14/0.39 % (1823)Termination phase: Property scanning
% 0.14/0.39
% 0.14/0.39 % (1824)Instruction limit reached!
% 0.14/0.39 % (1824)------------------------------
% 0.14/0.39 % (1824)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1823)Memory used [KB]: 895
% 0.14/0.39 % (1824)Termination reason: Unknown
% 0.14/0.39 % (1823)Time elapsed: 0.004 s
% 0.14/0.39 % (1824)Termination phase: Property scanning
% 0.14/0.39 % (1823)Instructions burned: 2 (million)
% 0.14/0.39
% 0.14/0.39 % (1823)------------------------------
% 0.14/0.39 % (1823)------------------------------
% 0.14/0.39 % (1824)Memory used [KB]: 895
% 0.14/0.39 % (1824)Time elapsed: 0.004 s
% 0.14/0.39 % (1824)Instructions burned: 2 (million)
% 0.14/0.39 % (1824)------------------------------
% 0.14/0.39 % (1824)------------------------------
% 0.14/0.40 % (1821)Instruction limit reached!
% 0.14/0.40 % (1821)------------------------------
% 0.14/0.40 % (1821)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (1821)Termination reason: Unknown
% 0.14/0.40 % (1821)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (1821)Memory used [KB]: 5500
% 0.14/0.40 % (1821)Time elapsed: 0.006 s
% 0.14/0.40 % (1821)Instructions burned: 4 (million)
% 0.14/0.40 % (1821)------------------------------
% 0.14/0.40 % (1821)------------------------------
% 0.14/0.40 % (1827)Instruction limit reached!
% 0.14/0.40 % (1827)------------------------------
% 0.14/0.40 % (1827)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (1827)Termination reason: Unknown
% 0.14/0.40 % (1827)Termination phase: Property scanning
% 0.14/0.40
% 0.14/0.40 % (1827)Memory used [KB]: 1023
% 0.14/0.40 % (1827)Time elapsed: 0.005 s
% 0.14/0.40 % (1827)Instructions burned: 3 (million)
% 0.14/0.40 % (1827)------------------------------
% 0.14/0.40 % (1827)------------------------------
% 0.14/0.40 % (1826)First to succeed.
% 0.14/0.41 % (1826)Refutation found. Thanks to Tanya!
% 0.14/0.41 % SZS status Theorem for theBenchmark
% 0.14/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.41 % (1826)------------------------------
% 0.14/0.41 % (1826)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (1826)Termination reason: Refutation
% 0.14/0.41
% 0.14/0.41 % (1826)Memory used [KB]: 5628
% 0.14/0.41 % (1826)Time elapsed: 0.016 s
% 0.14/0.41 % (1826)Instructions burned: 17 (million)
% 0.14/0.41 % (1826)------------------------------
% 0.14/0.41 % (1826)------------------------------
% 0.14/0.41 % (1819)Success in time 0.036 s
% 0.41/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------