TSTP Solution File: SET601^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET601^3 : TPTP v8.2.0. Released v3.6.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 : n010.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 03:12:19 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 29
% Syntax : Number of formulae : 128 ( 19 unt; 19 typ; 0 def)
% Number of atoms : 1469 ( 237 equ; 0 cnn)
% Maximal formula atoms : 5 ( 13 avg)
% Number of connectives : 1077 ( 35 ~; 282 |; 109 &; 644 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 107 ( 107 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 9 con; 0-3 aty)
% Number of variables : 75 ( 58 ^ 9 !; 6 ?; 75 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_29,type,
sK0: $i > $o ).
thf(func_def_30,type,
sK1: $i > $o ).
thf(func_def_31,type,
sK2: $i > $o ).
thf(func_def_33,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f338,plain,
$false,
inference(avatar_sat_refutation,[],[f273,f281,f288,f309,f316,f322,f329,f333,f337]) ).
thf(f337,plain,
( ~ spl3_1
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f336]) ).
thf(f336,plain,
( $false
| ~ spl3_1
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f335]) ).
thf(f335,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_6 ),
inference(backward_demodulation,[],[f258,f302]) ).
thf(f302,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f300]) ).
thf(f300,plain,
( spl3_6
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f258,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f256]) ).
thf(f256,plain,
( spl3_1
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f333,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f332]) ).
thf(f332,plain,
( $false
| ~ spl3_2
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f331]) ).
thf(f331,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_5 ),
inference(backward_demodulation,[],[f262,f298]) ).
thf(f298,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f296]) ).
thf(f296,plain,
( spl3_5
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f262,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f260]) ).
thf(f260,plain,
( spl3_2
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f329,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f328]) ).
thf(f328,plain,
( $false
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f327]) ).
thf(f327,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_4 ),
inference(backward_demodulation,[],[f266,f294]) ).
thf(f294,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f292]) ).
thf(f292,plain,
( spl3_4
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f266,plain,
( ( ( sK2 @ sK5 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f264]) ).
thf(f264,plain,
( spl3_3
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f322,plain,
( spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f98,f300,f296]) ).
thf(f98,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f97]) ).
thf(f97,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f95]) ).
thf(f95,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f94]) ).
thf(f94,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f92]) ).
thf(f92,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f91]) ).
thf(f91,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f74]) ).
thf(f74,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f73]) ).
thf(f73,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f72]) ).
thf(f72,plain,
( ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f70,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
!= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) )
& ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f64]) ).
thf(f64,plain,
( ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) )
& ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f63]) ).
thf(f63,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK0
@ sK2 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK2
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK1
@ sK0 ) ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK2 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK2
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK1
@ sK0 ) ) ) ),
inference(definition_unfolding,[],[f47,f59,f49,f59,f49,f49,f49,f59,f49,f59,f59]) ).
thf(f49,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f30]) ).
thf(f30,plain,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( union
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
| ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
thf(f59,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f22,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f21,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= intersection ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) )
= intersection ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
thf(f47,plain,
( ( intersection @ ( union @ sK0 @ sK2 ) @ ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK1 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK2 ) @ ( union @ ( intersection @ sK2 @ sK1 ) @ ( intersection @ sK1 @ sK0 ) ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( intersection @ ( union @ sK0 @ sK2 ) @ ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK1 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK2 ) @ ( union @ ( intersection @ sK2 @ sK1 ) @ ( intersection @ sK1 @ sK0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45]) ).
thf(f45,plain,
( ? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X1 @ X0 ) ) )
!= ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X1 ) @ ( intersection @ X1 @ X0 ) ) ) )
=> ( ( intersection @ ( union @ sK0 @ sK2 ) @ ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK1 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK2 ) @ ( union @ ( intersection @ sK2 @ sK1 ) @ ( intersection @ sK1 @ sK0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X1 @ X0 ) ) )
!= ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X1 ) @ ( intersection @ X1 @ X0 ) ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X1 @ X0 ) ) )
= ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X1 ) @ ( intersection @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X4: $i > $o,X2: $i > $o] :
( ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X4 ) @ ( intersection @ X4 @ X0 ) ) )
= ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X4 ) @ ( union @ X4 @ X0 ) ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X0: $i > $o,X4: $i > $o,X2: $i > $o] :
( ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X4 ) @ ( intersection @ X4 @ X0 ) ) )
= ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X4 ) @ ( union @ X4 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f316,plain,
( spl3_4
| spl3_6 ),
inference(avatar_split_clause,[],[f118,f300,f292]) ).
thf(f118,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f117]) ).
thf(f117,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f115]) ).
thf(f115,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f109]) ).
thf(f109,plain,
( ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f108]) ).
thf(f108,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f107]) ).
thf(f107,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(duplicate_literal_removal,[],[f106]) ).
thf(f106,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f103]) ).
thf(f103,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f71,plain,
( ( $false
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f309,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f144,f296,f292]) ).
thf(f144,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f142]) ).
thf(f142,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f141]) ).
thf(f141,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f140]) ).
thf(f140,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f138]) ).
thf(f138,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f137]) ).
thf(f137,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f135]) ).
thf(f135,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f134]) ).
thf(f134,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f133]) ).
thf(f133,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f69,plain,
( ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $false )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f288,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f182,f260,f256]) ).
thf(f182,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f181]) ).
thf(f181,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f180]) ).
thf(f180,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f178]) ).
thf(f178,plain,
( ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f169]) ).
thf(f169,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f168]) ).
thf(f168,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f166]) ).
thf(f166,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f165]) ).
thf(f165,plain,
( ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f163]) ).
thf(f163,plain,
( ( $true
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f162]) ).
thf(f162,plain,
( ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( $true
= ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $true )
| ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f281,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f210,f264,f256]) ).
thf(f210,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f208]) ).
thf(f208,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f207]) ).
thf(f207,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f206]) ).
thf(f206,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f204]) ).
thf(f204,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f203]) ).
thf(f203,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f202]) ).
thf(f202,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f200]) ).
thf(f200,plain,
( ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f164]) ).
thf(f164,plain,
( ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true )
| ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f163]) ).
thf(f273,plain,
( spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f238,f264,f260]) ).
thf(f238,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f236]) ).
thf(f236,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f235]) ).
thf(f235,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f234]) ).
thf(f234,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f232]) ).
thf(f232,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f231]) ).
thf(f231,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f230]) ).
thf(f230,plain,
( ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f228]) ).
thf(f228,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f227]) ).
thf(f227,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f161]) ).
thf(f161,plain,
( ( $true
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET601^3 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.14 % 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.15/0.38 % Computer : n010.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon May 20 11:50:53 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a TH0_THM_EQU_NAR problem
% 0.15/0.39 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.15/0.40 % (18148)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.40 % (18149)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.15/0.40 % (18145)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.15/0.40 % (18146)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.15/0.40 % (18147)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.15/0.40 % (18150)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.15/0.40 % (18152)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.15/0.41 % (18148)Instruction limit reached!
% 0.15/0.41 % (18148)------------------------------
% 0.15/0.41 % (18148)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (18148)Termination reason: Unknown
% 0.15/0.41 % (18148)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (18149)Instruction limit reached!
% 0.15/0.41 % (18149)------------------------------
% 0.15/0.41 % (18149)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (18148)Memory used [KB]: 1023
% 0.15/0.41 % (18148)Time elapsed: 0.003 s
% 0.15/0.41 % (18148)Instructions burned: 2 (million)
% 0.15/0.41 % (18148)------------------------------
% 0.15/0.41 % (18148)------------------------------
% 0.15/0.41 % (18149)Termination reason: Unknown
% 0.15/0.41 % (18149)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (18149)Memory used [KB]: 1023
% 0.15/0.41 % (18149)Time elapsed: 0.003 s
% 0.15/0.41 % (18149)Instructions burned: 2 (million)
% 0.15/0.41 % (18149)------------------------------
% 0.15/0.41 % (18149)------------------------------
% 0.15/0.41 % (18152)Instruction limit reached!
% 0.15/0.41 % (18152)------------------------------
% 0.15/0.41 % (18152)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (18151)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.41 % (18152)Termination reason: Unknown
% 0.15/0.41 % (18152)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (18152)Memory used [KB]: 1023
% 0.15/0.41 % (18152)Time elapsed: 0.003 s
% 0.15/0.41 % (18152)Instructions burned: 3 (million)
% 0.15/0.41 % (18152)------------------------------
% 0.15/0.41 % (18152)------------------------------
% 0.15/0.41 % (18146)Instruction limit reached!
% 0.15/0.41 % (18146)------------------------------
% 0.15/0.41 % (18146)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (18146)Termination reason: Unknown
% 0.15/0.41 % (18146)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (18146)Memory used [KB]: 1023
% 0.15/0.41 % (18146)Time elapsed: 0.004 s
% 0.15/0.41 % (18146)Instructions burned: 4 (million)
% 0.15/0.41 % (18146)------------------------------
% 0.15/0.41 % (18146)------------------------------
% 0.15/0.41 % (18147)First to succeed.
% 0.15/0.41 % (18150)Also succeeded, but the first one will report.
% 0.15/0.42 % (18145)Also succeeded, but the first one will report.
% 0.15/0.42 % (18147)Refutation found. Thanks to Tanya!
% 0.15/0.42 % SZS status Theorem for theBenchmark
% 0.15/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.42 % (18147)------------------------------
% 0.15/0.42 % (18147)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.42 % (18147)Termination reason: Refutation
% 0.15/0.42
% 0.15/0.42 % (18147)Memory used [KB]: 5628
% 0.15/0.42 % (18147)Time elapsed: 0.011 s
% 0.15/0.42 % (18147)Instructions burned: 10 (million)
% 0.15/0.42 % (18147)------------------------------
% 0.15/0.42 % (18147)------------------------------
% 0.15/0.42 % (18144)Success in time 0.012 s
% 0.15/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------