TSTP Solution File: SEV387^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV387^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 : n003.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:38 EDT 2024
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 15
% Syntax : Number of formulae : 99 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 933 ( 222 equ; 0 cnn)
% Maximal formula atoms : 5 ( 10 avg)
% Number of connectives : 1172 ( 166 ~; 204 |; 264 &; 531 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 20 ^ 12 !; 6 ?; 39 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_9,type,
sK0: a > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > $o ).
thf(func_def_13,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK5: a ).
thf(f358,plain,
$false,
inference(avatar_sat_refutation,[],[f294,f303,f320,f333,f339,f346,f349,f357]) ).
thf(f357,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f356]) ).
thf(f356,plain,
( $false
| ~ spl3_1
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f352]) ).
thf(f352,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_2 ),
inference(superposition,[],[f271,f267]) ).
thf(f267,plain,
( ( ( sK2 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f265]) ).
thf(f265,plain,
( spl3_1
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f271,plain,
( ( ( sK2 @ sK5 )
= $false )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f269]) ).
thf(f269,plain,
( spl3_2
<=> ( ( sK2 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f349,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f348]) ).
thf(f348,plain,
( $false
| ~ spl3_5
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f347]) ).
thf(f347,plain,
( ( $false = $true )
| ~ spl3_5
| ~ spl3_6 ),
inference(forward_demodulation,[],[f291,f284]) ).
thf(f284,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f282]) ).
thf(f282,plain,
( spl3_5
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f291,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f289]) ).
thf(f289,plain,
( spl3_6
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f346,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f345]) ).
thf(f345,plain,
( $false
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f342]) ).
thf(f342,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f275,f279]) ).
thf(f279,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f277]) ).
thf(f277,plain,
( spl3_4
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f275,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f273]) ).
thf(f273,plain,
( spl3_3
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f339,plain,
( spl3_3
| spl3_6
| spl3_2 ),
inference(avatar_split_clause,[],[f31,f269,f289,f273]) ).
thf(f31,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f30]) ).
thf(f30,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f28]) ).
thf(f28,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f20,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $false )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
= $false )
| ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
& ( sK2 @ sK5 ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
& ( sK2 @ sK5 ) )
!= ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK2 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) )
!= ( ^ [Y0: a] :
( ( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK2 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) )
!= ( ^ [Y0: a] :
( ( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK2 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) ) )
& ( X2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
& ( X0 @ Y0 ) )
| ( ( X1 @ Y0 )
& ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ) )
=> ( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) )
!= ( ^ [Y0: a] :
( ( ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK2 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) ) )
& ( X2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
& ( X0 @ Y0 ) )
| ( ( X1 @ Y0 )
& ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) )
| ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) ) )
& ( X2 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
& ( X0 @ Y0 ) )
| ( ( X1 @ Y0 )
& ( X2 @ Y0 )
& ~ ( ( X2 @ Y0 )
& ( X0 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X2 @ X3 )
& ( ( ~ ( X0 @ X3 )
& ( X1 @ X3 ) )
| ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) ) ) ) )
= ( ^ [X4: a] :
( ( ~ ( ( X0 @ X4 )
& ( X2 @ X4 ) )
& ( X2 @ X4 )
& ( X1 @ X4 ) )
| ( ( X0 @ X4 )
& ~ ( ( X1 @ X4 )
& ( X2 @ X4 ) )
& ( X2 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
& ( ( ~ ( X2 @ X3 )
& ( X1 @ X3 ) )
| ( ~ ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) )
= ( ^ [X4: a] :
( ( ~ ( ( X2 @ X4 )
& ( X0 @ X4 ) )
& ( X0 @ X4 )
& ( X1 @ X4 ) )
| ( ( X2 @ X4 )
& ~ ( ( X1 @ X4 )
& ( X0 @ X4 ) )
& ( X0 @ X4 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
& ( ( ~ ( X2 @ X3 )
& ( X1 @ X3 ) )
| ( ~ ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) )
= ( ^ [X4: a] :
( ( ~ ( ( X2 @ X4 )
& ( X0 @ X4 ) )
& ( X0 @ X4 )
& ( X1 @ X4 ) )
| ( ( X2 @ X4 )
& ~ ( ( X1 @ X4 )
& ( X0 @ X4 ) )
& ( X0 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM44_pme) ).
thf(f333,plain,
( spl3_2
| spl3_5
| spl3_4 ),
inference(avatar_split_clause,[],[f63,f277,f282,f269]) ).
thf(f63,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f62]) ).
thf(f62,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f61]) ).
thf(f61,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f60]) ).
thf(f60,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f59]) ).
thf(f59,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( sK0 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f52,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f51,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $false )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f40,plain,
( ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f320,plain,
( spl3_6
| spl3_4 ),
inference(avatar_split_clause,[],[f132,f277,f289]) ).
thf(f132,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f131]) ).
thf(f131,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f129]) ).
thf(f129,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f128]) ).
thf(f128,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f126]) ).
thf(f126,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f70,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f69,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f65]) ).
thf(f65,plain,
( ( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
= $true )
| ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
& ( sK2 @ sK5 ) )
= $true )
| ( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f303,plain,
( spl3_3
| spl3_2
| spl3_5 ),
inference(avatar_split_clause,[],[f210,f282,f269,f273]) ).
thf(f210,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f209]) ).
thf(f209,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f208]) ).
thf(f208,plain,
( ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f207]) ).
thf(f207,plain,
( ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f206]) ).
thf(f206,plain,
( ( ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f205]) ).
thf(f205,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f195]) ).
thf(f195,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f194]) ).
thf(f194,plain,
( ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f193]) ).
thf(f193,plain,
( ( ( ~ ( sK1 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f174]) ).
thf(f174,plain,
( ( ( ~ ( sK0 @ sK5 ) )
= $true )
| ( ( ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f146]) ).
thf(f146,plain,
( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( ~ ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f145]) ).
thf(f145,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( ~ ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ~ ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f294,plain,
spl3_1,
inference(avatar_split_clause,[],[f248,f265]) ).
thf(f248,plain,
( ( sK2 @ sK5 )
= $true ),
inference(duplicate_literal_removal,[],[f247]) ).
thf(f247,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f245]) ).
thf(f245,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f238]) ).
thf(f238,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f237]) ).
thf(f237,plain,
( ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f235]) ).
thf(f235,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f233]) ).
thf(f233,plain,
( ( ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f64]) ).
thf(f64,plain,
( ( ( ( ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 )
& ~ ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV387^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.13/0.36 % Computer : n003.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 18:46:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a TH0_THM_EQU_NAR problem
% 0.20/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.20/0.38 % (18814)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.20/0.38 % (18810)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.20/0.38 % (18813)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.20/0.38 % (18812)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.38 % (18815)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.38 % (18811)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.20/0.38 % (18809)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.20/0.38 % (18816)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.20/0.38 % (18810)Instruction limit reached!
% 0.20/0.38 % (18810)------------------------------
% 0.20/0.38 % (18810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (18810)Termination reason: Unknown
% 0.20/0.38 % (18810)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (18810)Memory used [KB]: 5500
% 0.20/0.38 % (18810)Time elapsed: 0.004 s
% 0.20/0.38 % (18810)Instructions burned: 4 (million)
% 0.20/0.38 % (18812)Instruction limit reached!
% 0.20/0.38 % (18812)------------------------------
% 0.20/0.38 % (18812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (18812)Termination reason: Unknown
% 0.20/0.38 % (18812)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (18812)Memory used [KB]: 5500
% 0.20/0.38 % (18812)Time elapsed: 0.003 s
% 0.20/0.38 % (18812)Instructions burned: 2 (million)
% 0.20/0.38 % (18812)------------------------------
% 0.20/0.38 % (18812)------------------------------
% 0.20/0.38 % (18810)------------------------------
% 0.20/0.38 % (18810)------------------------------
% 0.20/0.38 % (18813)Instruction limit reached!
% 0.20/0.38 % (18813)------------------------------
% 0.20/0.38 % (18813)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (18813)Termination reason: Unknown
% 0.20/0.38 % (18813)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (18813)Memory used [KB]: 5500
% 0.20/0.38 % (18813)Time elapsed: 0.003 s
% 0.20/0.38 % (18813)Instructions burned: 2 (million)
% 0.20/0.38 % (18813)------------------------------
% 0.20/0.38 % (18813)------------------------------
% 0.20/0.38 % (18816)Instruction limit reached!
% 0.20/0.38 % (18816)------------------------------
% 0.20/0.38 % (18816)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (18816)Termination reason: Unknown
% 0.20/0.38 % (18816)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (18816)Memory used [KB]: 5500
% 0.20/0.38 % (18816)Time elapsed: 0.003 s
% 0.20/0.38 % (18816)Instructions burned: 3 (million)
% 0.20/0.38 % (18816)------------------------------
% 0.20/0.38 % (18816)------------------------------
% 0.20/0.38 % (18814)First to succeed.
% 0.20/0.39 % (18809)Also succeeded, but the first one will report.
% 0.20/0.39 % (18811)Also succeeded, but the first one will report.
% 0.20/0.39 % (18814)Refutation found. Thanks to Tanya!
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39 % (18814)------------------------------
% 0.20/0.39 % (18814)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (18814)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (18814)Memory used [KB]: 5628
% 0.20/0.39 % (18814)Time elapsed: 0.012 s
% 0.20/0.39 % (18814)Instructions burned: 11 (million)
% 0.20/0.39 % (18814)------------------------------
% 0.20/0.39 % (18814)------------------------------
% 0.20/0.39 % (18808)Success in time 0.02 s
% 0.20/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------