TSTP Solution File: SEV417^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV417^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.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:13:42 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 26 unt; 9 typ; 0 def)
% Number of atoms : 477 ( 101 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 597 ( 47 ~; 61 |; 99 &; 302 @)
% ( 3 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 10 usr; 8 con; 0-2 aty)
% ( 39 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 171 ( 142 ^ 28 !; 0 ?; 171 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cP: ( a > $o ) > $o ).
thf(func_def_16,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK2: a > $o ).
thf(func_def_18,type,
sK3: a > $o ).
thf(func_def_19,type,
sK4: a > $o ).
thf(func_def_20,type,
sK5: a ).
thf(func_def_21,type,
sK6: a ).
thf(f116,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f69,f108,f115]) ).
thf(f115,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f114]) ).
thf(f114,plain,
( $false
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f113,f76]) ).
thf(f76,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
!= sK3 )
| ~ spl0_1
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
!= sK3 )
| ( $true = $false )
| ~ spl0_1
| ~ spl0_2 ),
inference(constrained_superposition,[],[f72,f35]) ).
thf(f35,plain,
( ( cP
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) )
& ( cP
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( $true
= ( ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) )
& ( cP
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( $true
= ( ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) )
& ( cP
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK4 @ Y0 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) )
& ( cP
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK4 @ Y0 ) ) ) )
=> ( ( sK3
= ( ^ [Y0: a] : $false ) )
& ( cP
@ ^ [Y0: a] : $false ) ) )
= $false ),
inference(beta_eta_normalization,[],[f12]) ).
thf(f12,plain,
( ( ^ [Y0: a > $o] :
( ( ( !! @ a
@ ^ [Y1: a] :
( ( sK3 @ Y1 )
=> ( sK2 @ Y1 ) ) )
& ( cP
@ ^ [Y1: a] :
( ( sK2 @ Y1 )
& ( Y0 @ Y1 ) ) )
& ( ( ^ [Y1: a] : $false )
= ( ^ [Y1: a] :
( ( Y0 @ Y1 )
& ( sK2 @ Y1 ) ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( sK3 @ Y1 )
=> ( Y0 @ Y1 ) ) ) )
=> ( ( sK3
= ( ^ [Y1: a] : $false ) )
& ( cP
@ ^ [Y1: a] : $false ) ) )
@ sK4 )
= $false ),
inference(sigma_clausification,[],[f11]) ).
thf(f11,plain,
( ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( ( !! @ a
@ ^ [Y1: a] :
( ( sK3 @ Y1 )
=> ( sK2 @ Y1 ) ) )
& ( cP
@ ^ [Y1: a] :
( ( sK2 @ Y1 )
& ( Y0 @ Y1 ) ) )
& ( ( ^ [Y1: a] : $false )
= ( ^ [Y1: a] :
( ( Y0 @ Y1 )
& ( sK2 @ Y1 ) ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( sK3 @ Y1 )
=> ( Y0 @ Y1 ) ) ) )
=> ( ( sK3
= ( ^ [Y1: a] : $false ) )
& ( cP
@ ^ [Y1: a] : $false ) ) ) )
= $false ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( sK2 @ Y2 ) ) )
& ( cP
@ ^ [Y2: a] :
( ( sK2 @ Y2 )
& ( Y1 @ Y2 ) ) )
& ( ( ^ [Y2: a] : $false )
= ( ^ [Y2: a] :
( ( Y1 @ Y2 )
& ( sK2 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) )
=> ( ( Y0
= ( ^ [Y2: a] : $false ) )
& ( cP
@ ^ [Y2: a] : $false ) ) ) )
@ sK3 )
= $false ),
inference(sigma_clausification,[],[f9]) ).
thf(f9,plain,
( $false
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( sK2 @ Y2 ) ) )
& ( cP
@ ^ [Y2: a] :
( ( sK2 @ Y2 )
& ( Y1 @ Y2 ) ) )
& ( ( ^ [Y2: a] : $false )
= ( ^ [Y2: a] :
( ( Y1 @ Y2 )
& ( sK2 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) )
=> ( ( Y0
= ( ^ [Y2: a] : $false ) )
& ( cP
@ ^ [Y2: a] : $false ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y0 @ Y3 ) ) )
& ( cP
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
& ( Y2 @ Y3 ) ) )
& ( ( ^ [Y3: a] : $false )
= ( ^ [Y3: a] :
( ( Y2 @ Y3 )
& ( Y0 @ Y3 ) ) ) )
& ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y2 @ Y3 ) ) ) )
=> ( ( Y1
= ( ^ [Y3: a] : $false ) )
& ( cP
@ ^ [Y3: a] : $false ) ) ) ) )
@ sK2 )
= $false ),
inference(sigma_clausification,[],[f7]) ).
thf(f7,plain,
( $false
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y0 @ Y3 ) ) )
& ( cP
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
& ( Y2 @ Y3 ) ) )
& ( ( ^ [Y3: a] : $false )
= ( ^ [Y3: a] :
( ( Y2 @ Y3 )
& ( Y0 @ Y3 ) ) ) )
& ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y2 @ Y3 ) ) ) )
=> ( ( Y1
= ( ^ [Y3: a] : $false ) )
& ( cP
@ ^ [Y3: a] : $false ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f6]) ).
thf(f6,plain,
( $true
= ( ~ ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y0 @ Y3 ) ) )
& ( cP
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
& ( Y2 @ Y3 ) ) )
& ( ( ^ [Y3: a] : $false )
= ( ^ [Y3: a] :
( ( Y2 @ Y3 )
& ( Y0 @ Y3 ) ) ) )
& ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y2 @ Y3 ) ) ) )
=> ( ( Y1
= ( ^ [Y3: a] : $false ) )
& ( cP
@ ^ [Y3: a] : $false ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f5,plain,
( $true
= ( ~ ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( !! @ ( a > $o )
@ ^ [Y1: a > $o] :
( !! @ ( a > $o )
@ ^ [Y2: a > $o] :
( ( ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y0 @ Y3 ) ) )
& ( cP
@ ^ [Y3: a] :
( ( Y0 @ Y3 )
& ( Y2 @ Y3 ) ) )
& ( ( ^ [Y3: a] : $false )
= ( ^ [Y3: a] :
( ( Y2 @ Y3 )
& ( Y0 @ Y3 ) ) ) )
& ( !! @ a
@ ^ [Y3: a] :
( ( Y1 @ Y3 )
=> ( Y2 @ Y3 ) ) ) )
=> ( ( Y1
= ( ^ [Y3: a] : $false ) )
& ( cP
@ ^ [Y3: a] : $false ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X1 @ X3 )
=> ( X0 @ X3 ) )
& ( ( ^ [X4: a] : $false )
= ( ^ [X5: a] :
( ( X2 @ X5 )
& ( X0 @ X5 ) ) ) )
& ( cP
@ ^ [X6: a] :
( ( X0 @ X6 )
& ( X2 @ X6 ) ) )
& ! [X7: a] :
( ( X1 @ X7 )
=> ( X2 @ X7 ) ) )
=> ( ( cP
@ ^ [X8: a] : $false )
& ( X1
= ( ^ [X9: a] : $false ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ( ( ^ [X3: a] : $false )
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ( X1 @ X3 ) ) ) )
& ( cP
@ ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X2 @ X3 ) ) )
=> ( ( cP
@ ^ [X3: a] : $false )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ( ( ^ [X3: a] : $false )
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ( X1 @ X3 ) ) ) )
& ( cP
@ ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X2 @ X3 ) ) )
=> ( ( cP
@ ^ [X3: a] : $false )
& ( X0
= ( ^ [X3: a] : $false ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM502_pme) ).
thf(f72,plain,
( ( ( cP @ sK3 )
= $false )
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[],[f21,f24]) ).
thf(f24,plain,
( ( ( ^ [Y0: a] : $false )
= sK3 )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl0_2
<=> ( ( ^ [Y0: a] : $false )
= sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f21,plain,
( ( ( cP
@ ^ [Y0: a] : $false )
= $false )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl0_1
<=> ( ( cP
@ ^ [Y0: a] : $false )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f113,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
= sK3 )
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f55,f24]) ).
thf(f55,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_3
<=> ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f108,plain,
( ~ spl0_2
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f107]) ).
thf(f107,plain,
( $false
| ~ spl0_2
| spl0_3 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f106,plain,
( ( $true = $false )
| ~ spl0_2
| spl0_3 ),
inference(backward_demodulation,[],[f101,f105]) ).
thf(f105,plain,
( ( ( sK2 @ sK6 )
= $false )
| ~ spl0_2
| spl0_3 ),
inference(trivial_inequality_removal,[],[f102]) ).
thf(f102,plain,
( ( $true = $false )
| ( ( sK2 @ sK6 )
= $false )
| ~ spl0_2
| spl0_3 ),
inference(superposition,[],[f100,f44]) ).
thf(f44,plain,
! [X1: a] :
( ( $false
= ( sK4 @ X1 ) )
| ( $false
= ( sK2 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
! [X1: a] :
( ( ( sK4 @ X1 )
& ( sK2 @ X1 ) )
= $false ),
inference(beta_eta_normalization,[],[f42]) ).
thf(f42,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) ),
inference(argument_congruence,[],[f34]) ).
thf(f34,plain,
( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) ) ) ),
inference(equality_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( $true
= ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK4 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f100,plain,
( ( $true
= ( sK4 @ sK6 ) )
| ~ spl0_2
| spl0_3 ),
inference(binary_proxy_clausification,[],[f99]) ).
thf(f99,plain,
( ( ( ( sK2 @ sK6 )
& ( sK4 @ sK6 ) )
!= $false )
| ~ spl0_2
| spl0_3 ),
inference(forward_demodulation,[],[f94,f79]) ).
thf(f79,plain,
( ! [X1: a] :
( ( sK3 @ X1 )
= $false )
| ~ spl0_2 ),
inference(beta_eta_normalization,[],[f77]) ).
thf(f77,plain,
( ! [X1: a] :
( ( sK3 @ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f24]) ).
thf(f94,plain,
( ( ( ( sK2 @ sK6 )
& ( sK4 @ sK6 ) )
!= ( sK3 @ sK6 ) )
| ~ spl0_2
| spl0_3 ),
inference(beta_eta_normalization,[],[f91]) ).
thf(f91,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) )
@ sK6 )
!= ( sK3 @ sK6 ) )
| ~ spl0_2
| spl0_3 ),
inference(negative_extensionality,[],[f70]) ).
thf(f70,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
!= sK3 )
| ~ spl0_2
| spl0_3 ),
inference(backward_demodulation,[],[f56,f24]) ).
thf(f56,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK4 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| spl0_3 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f101,plain,
( ( $true
= ( sK2 @ sK6 ) )
| ~ spl0_2
| spl0_3 ),
inference(binary_proxy_clausification,[],[f99]) ).
thf(f69,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| spl0_2 ),
inference(subsumption_resolution,[],[f64,f41]) ).
thf(f41,plain,
( ( ( sK3 @ sK5 )
!= $false )
| spl0_2 ),
inference(beta_eta_normalization,[],[f40]) ).
thf(f40,plain,
( ( ( sK3 @ sK5 )
!= ( ^ [Y0: a] : $false
@ sK5 ) )
| spl0_2 ),
inference(negative_extensionality,[],[f25]) ).
thf(f25,plain,
( ( ( ^ [Y0: a] : $false )
!= sK3 )
| spl0_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f64,plain,
( ( ( sK3 @ sK5 )
= $false )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f62,plain,
( ( $true = $false )
| ( ( sK3 @ sK5 )
= $false )
| spl0_2 ),
inference(superposition,[],[f50,f39]) ).
thf(f39,plain,
! [X1: a] :
( ( $true
= ( sK2 @ X1 ) )
| ( ( sK3 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f38]) ).
thf(f38,plain,
! [X1: a] :
( ( ( sK3 @ X1 )
=> ( sK2 @ X1 ) )
= $true ),
inference(beta_eta_normalization,[],[f37]) ).
thf(f37,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f36]) ).
thf(f36,plain,
( $true
= ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK2 @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f50,plain,
( ( ( sK2 @ sK5 )
= $false )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $false != $false )
| spl0_2 ),
inference(superposition,[],[f41,f48]) ).
thf(f48,plain,
! [X0: a] :
( ( ( sK3 @ X0 )
= $false )
| ( ( sK2 @ X0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
! [X0: a] :
( ( ( sK3 @ X0 )
= $false )
| ( $true = $false )
| ( ( sK2 @ X0 )
= $false ) ),
inference(superposition,[],[f44,f31]) ).
thf(f31,plain,
! [X1: a] :
( ( $true
= ( sK4 @ X1 ) )
| ( ( sK3 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
! [X1: a] :
( $true
= ( ( sK3 @ X1 )
=> ( sK4 @ X1 ) ) ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
! [X1: a] :
( $true
= ( ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK4 @ Y0 ) )
@ X1 ) ),
inference(pi_clausification,[],[f27]) ).
thf(f27,plain,
( $true
= ( !! @ a
@ ^ [Y0: a] :
( ( sK3 @ Y0 )
=> ( sK4 @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f26,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f17,f23,f19]) ).
thf(f17,plain,
( ( ( ^ [Y0: a] : $false )
!= sK3 )
| ( ( cP
@ ^ [Y0: a] : $false )
= $false ) ),
inference(equality_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( sK3
= ( ^ [Y0: a] : $false ) )
= $false )
| ( ( cP
@ ^ [Y0: a] : $false )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( sK3
= ( ^ [Y0: a] : $false ) )
& ( cP
@ ^ [Y0: a] : $false ) )
= $false ),
inference(binary_proxy_clausification,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV417^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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 : n026.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 19:16:23 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.38 % (14837)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 (3000ds/27Mi)
% 0.14/0.38 % (14835)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.14/0.38 % (14836)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 (3000ds/4Mi)
% 0.14/0.38 % (14838)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (14839)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 (3000ds/2Mi)
% 0.14/0.38 % (14842)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.38 % (14838)Instruction limit reached!
% 0.14/0.38 % (14838)------------------------------
% 0.14/0.38 % (14838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14838)Termination reason: Unknown
% 0.14/0.38 % (14838)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (14838)Memory used [KB]: 895
% 0.14/0.38 % (14838)Time elapsed: 0.003 s
% 0.14/0.38 % (14838)Instructions burned: 2 (million)
% 0.14/0.38 % (14838)------------------------------
% 0.14/0.38 % (14838)------------------------------
% 0.14/0.38 % (14839)Instruction limit reached!
% 0.14/0.38 % (14839)------------------------------
% 0.14/0.38 % (14839)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14839)Termination reason: Unknown
% 0.14/0.38 % (14839)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (14839)Memory used [KB]: 895
% 0.14/0.38 % (14839)Time elapsed: 0.003 s
% 0.14/0.38 % (14839)Instructions burned: 2 (million)
% 0.14/0.38 % (14839)------------------------------
% 0.14/0.38 % (14839)------------------------------
% 0.14/0.38 % (14837)Refutation not found, incomplete strategy
% 0.14/0.38 % (14837)------------------------------
% 0.14/0.38 % (14837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14837)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (14837)Memory used [KB]: 5500
% 0.14/0.38 % (14837)Time elapsed: 0.005 s
% 0.14/0.38 % (14837)Instructions burned: 2 (million)
% 0.14/0.38 % (14837)------------------------------
% 0.14/0.38 % (14837)------------------------------
% 0.14/0.38 % (14842)Refutation not found, incomplete strategy
% 0.14/0.38 % (14842)------------------------------
% 0.14/0.38 % (14842)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14842)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (14842)Memory used [KB]: 5500
% 0.14/0.38 % (14842)Time elapsed: 0.004 s
% 0.14/0.38 % (14842)Instructions burned: 2 (million)
% 0.14/0.38 % (14842)------------------------------
% 0.14/0.38 % (14842)------------------------------
% 0.14/0.38 % (14840)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 (3000ds/275Mi)
% 0.14/0.38 % (14836)Instruction limit reached!
% 0.14/0.38 % (14836)------------------------------
% 0.14/0.38 % (14836)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14836)Termination reason: Unknown
% 0.14/0.38 % (14836)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (14836)Memory used [KB]: 5500
% 0.14/0.38 % (14836)Time elapsed: 0.006 s
% 0.14/0.38 % (14836)Instructions burned: 5 (million)
% 0.14/0.38 % (14836)------------------------------
% 0.14/0.38 % (14836)------------------------------
% 0.14/0.38 % (14835)Refutation not found, incomplete strategy
% 0.14/0.38 % (14835)------------------------------
% 0.14/0.38 % (14835)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14835)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (14835)Memory used [KB]: 5500
% 0.14/0.38 % (14835)Time elapsed: 0.007 s
% 0.14/0.38 % (14835)Instructions burned: 5 (million)
% 0.14/0.38 % (14835)------------------------------
% 0.14/0.38 % (14835)------------------------------
% 0.14/0.38 % (14840)Refutation not found, incomplete strategy
% 0.14/0.38 % (14840)------------------------------
% 0.14/0.38 % (14840)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (14840)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (14840)Memory used [KB]: 5500
% 0.14/0.38 % (14840)Time elapsed: 0.005 s
% 0.14/0.38 % (14840)Instructions burned: 2 (million)
% 0.14/0.38 % (14840)------------------------------
% 0.14/0.38 % (14840)------------------------------
% 0.14/0.39 % (14841)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.39 % (14844)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.39 % (14841)Refutation not found, incomplete strategy
% 0.14/0.39 % (14841)------------------------------
% 0.14/0.39 % (14841)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (14841)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (14841)Memory used [KB]: 5500
% 0.14/0.39 % (14841)Time elapsed: 0.004 s
% 0.14/0.39 % (14841)Instructions burned: 2 (million)
% 0.14/0.39 % (14841)------------------------------
% 0.14/0.39 % (14841)------------------------------
% 0.14/0.39 % (14843)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.39 % (14845)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.39 % (14844)Refutation not found, incomplete strategy
% 0.14/0.39 % (14844)------------------------------
% 0.14/0.39 % (14844)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (14844)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (14844)Memory used [KB]: 5628
% 0.14/0.39 % (14844)Time elapsed: 0.026 s
% 0.14/0.39 % (14844)Instructions burned: 5 (million)
% 0.14/0.39 % (14844)------------------------------
% 0.14/0.39 % (14844)------------------------------
% 0.14/0.40 % (14847)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.40 % (14846)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.14/0.40 % (14848)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.14/0.40 % (14845)Instruction limit reached!
% 0.14/0.40 % (14845)------------------------------
% 0.14/0.40 % (14845)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (14845)Termination reason: Unknown
% 0.14/0.40 % (14845)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (14845)Memory used [KB]: 5500
% 0.14/0.40 % (14845)Time elapsed: 0.004 s
% 0.14/0.40 % (14845)Instructions burned: 3 (million)
% 0.14/0.40 % (14845)------------------------------
% 0.14/0.40 % (14845)------------------------------
% 0.14/0.40 % (14849)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.40 % (14843)First to succeed.
% 0.14/0.40 % (14849)Instruction limit reached!
% 0.14/0.40 % (14849)------------------------------
% 0.14/0.40 % (14849)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (14849)Termination reason: Unknown
% 0.14/0.40 % (14849)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (14847)Instruction limit reached!
% 0.14/0.40 % (14847)------------------------------
% 0.14/0.40 % (14847)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (14847)Termination reason: Unknown
% 0.14/0.40 % (14847)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (14847)Memory used [KB]: 1023
% 0.14/0.40 % (14847)Time elapsed: 0.007 s
% 0.14/0.40 % (14847)Instructions burned: 7 (million)
% 0.14/0.40 % (14847)------------------------------
% 0.14/0.40 % (14847)------------------------------
% 0.14/0.40 % (14849)Memory used [KB]: 5500
% 0.14/0.40 % (14849)Time elapsed: 0.004 s
% 0.14/0.40 % (14849)Instructions burned: 3 (million)
% 0.14/0.40 % (14849)------------------------------
% 0.14/0.40 % (14849)------------------------------
% 0.14/0.40 % (14843)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (14843)------------------------------
% 0.14/0.40 % (14843)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (14843)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (14843)Memory used [KB]: 5628
% 0.14/0.40 % (14843)Time elapsed: 0.033 s
% 0.14/0.40 % (14843)Instructions burned: 10 (million)
% 0.14/0.40 % (14843)------------------------------
% 0.14/0.40 % (14843)------------------------------
% 0.14/0.40 % (14834)Success in time 0.047 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------