TSTP Solution File: SYO331^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO331^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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 09:04:00 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 56 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 523 ( 136 equ; 0 cnn)
% Maximal formula atoms : 10 ( 11 avg)
% Number of connectives : 882 ( 86 ~; 78 |; 71 &; 515 @)
% ( 3 <=>; 73 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 113 ( 113 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 10 usr; 8 con; 0-2 aty)
% ( 28 !!; 28 ??; 0 @@+; 0 @@-)
% Number of variables : 197 ( 90 ^ 73 !; 32 ?; 197 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cK: ( a > $o ) > a > $o ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_13,type,
sK0: a ).
thf(func_def_14,type,
sK1: a > $o ).
thf(func_def_15,type,
sK2: ( a > $o ) > a ).
thf(func_def_16,type,
sK3: ( a > $o ) > a ).
thf(func_def_18,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f88,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f36,f44,f85]) ).
thf(f85,plain,
( spl4_2
| ~ spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f84,f42,f25,f29]) ).
thf(f29,plain,
( spl4_2
<=> ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f25,plain,
( spl4_1
<=> ( ( sK1 @ ( sK2 @ sK1 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f42,plain,
( spl4_3
<=> ! [X0: a > $o] :
( ( ( X0 @ ( sK3 @ X0 ) )
= $true )
| ( ( X0 @ ( sK2 @ sK1 ) )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f84,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f83,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(forward_demodulation,[],[f75,f27]) ).
thf(f27,plain,
( ( ( sK1 @ ( sK2 @ sK1 ) )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f75,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ( ( sK1 @ ( sK2 @ sK1 ) )
!= $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( $true != $true )
| ( ( sK1 @ ( sK2 @ sK1 ) )
!= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(superposition,[],[f65,f21]) ).
thf(f21,plain,
( ( cK @ sK1 @ sK0 )
= $true ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
( ( ( cK @ sK1 @ sK0 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f18,f17]) ).
thf(f17,plain,
( ( sK1 @ sK0 )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
!= $true )
& ! [X2: a] :
( ( ( cK @ sK1 @ X2 )
= $true )
| ( ( sK1 @ X2 )
!= $true ) )
& ( ( sK1 @ sK0 )
= $true )
& ! [X3: a > $o] :
( ! [X4: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( cK @ X3 @ X4 )
!= $true ) )
| ( ! [X6: a > $o] :
( ( ( X6 @ ( sK2 @ X3 ) )
!= $true )
| ( ( ( cK @ X6 @ ( sK3 @ X6 ) )
!= $true )
& ( ( X6 @ ( sK3 @ X6 ) )
= $true ) ) )
& ( ( X3 @ ( sK2 @ X3 ) )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X0 )
!= $true )
& ? [X1: a > $o] :
( ! [X2: a] :
( ( ( cK @ X1 @ X2 )
= $true )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1 @ X0 )
= $true ) ) )
=> ( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
!= $true )
& ? [X1: a > $o] :
( ! [X2: a] :
( ( ( cK @ X1 @ X2 )
= $true )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1 @ sK0 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( cK @ X1 @ X2 )
= $true )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1 @ sK0 )
= $true ) )
=> ( ! [X2: a] :
( ( ( cK @ sK1 @ X2 )
= $true )
| ( ( sK1 @ X2 )
!= $true ) )
& ( ( sK1 @ sK0 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X3: a > $o] :
( ? [X5: a] :
( ! [X6: a > $o] :
( ( $true
!= ( X6 @ X5 ) )
| ? [X7: a] :
( ( ( cK @ X6 @ X7 )
!= $true )
& ( $true
= ( X6 @ X7 ) ) ) )
& ( ( X3 @ X5 )
= $true ) )
=> ( ! [X6: a > $o] :
( ( ( X6 @ ( sK2 @ X3 ) )
!= $true )
| ? [X7: a] :
( ( ( cK @ X6 @ X7 )
!= $true )
& ( $true
= ( X6 @ X7 ) ) ) )
& ( ( X3 @ ( sK2 @ X3 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X6: a > $o] :
( ? [X7: a] :
( ( ( cK @ X6 @ X7 )
!= $true )
& ( $true
= ( X6 @ X7 ) ) )
=> ( ( ( cK @ X6 @ ( sK3 @ X6 ) )
!= $true )
& ( ( X6 @ ( sK3 @ X6 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X0: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X0 )
!= $true )
& ? [X1: a > $o] :
( ! [X2: a] :
( ( ( cK @ X1 @ X2 )
= $true )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1 @ X0 )
= $true ) ) )
& ! [X3: a > $o] :
( ! [X4: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( cK @ X3 @ X4 )
!= $true ) )
| ? [X5: a] :
( ! [X6: a > $o] :
( ( $true
!= ( X6 @ X5 ) )
| ? [X7: a] :
( ( ( cK @ X6 @ X7 )
!= $true )
& ( $true
= ( X6 @ X7 ) ) ) )
& ( ( X3 @ X5 )
= $true ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ? [X5: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X5 )
!= $true )
& ? [X6: a > $o] :
( ! [X7: a] :
( ( ( cK @ X6 @ X7 )
= $true )
| ( $true
!= ( X6 @ X7 ) ) )
& ( $true
= ( X6 @ X5 ) ) ) )
& ! [X0: a > $o] :
( ! [X4: a] :
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( cK @ X0 @ X4 )
!= $true ) )
| ? [X1: a] :
( ! [X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
| ? [X3: a] :
( ( ( cK @ X2 @ X3 )
!= $true )
& ( ( X2 @ X3 )
= $true ) ) )
& ( ( X0 @ X1 )
= $true ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: a > $o] :
( ! [X1: a] :
( ( ( X0 @ X1 )
= $true )
=> ? [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
=> ( ( cK @ X2 @ X3 )
= $true ) )
& ( ( X2 @ X1 )
= $true ) ) )
=> ! [X4: a] :
( ( ( cK @ X0 @ X4 )
= $true )
=> ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true ) ) )
=> ! [X5: a] :
( ? [X6: a > $o] :
( ( $true
= ( X6 @ X5 ) )
& ! [X7: a] :
( ( $true
= ( X6 @ X7 ) )
=> ( ( cK @ X6 @ X7 )
= $true ) ) )
=> ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X5 )
= $true ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a > $o] :
( ! [X1: a] :
( ( ( X0 @ X1 )
= $true )
=> ? [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
=> ( ( cK @ X2 @ X3 )
= $true ) )
& ( ( X2 @ X1 )
= $true ) ) )
=> ! [X4: a] :
( ( ( cK @ X0 @ X4 )
= $true )
=> ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true ) ) )
=> ! [X8: a] :
( ? [X9: a > $o] :
( ( ( X9 @ X8 )
= $true )
& ! [X10: a] :
( ( ( X9 @ X10 )
= $true )
=> ( ( cK @ X9 @ X10 )
= $true ) ) )
=> ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X8 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a > $o] :
( ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cK @ X2 @ X3 ) ) ) )
=> ! [X4: a] :
( ( cK @ X0 @ X4 )
=> ( cK
@ ^ [X5: a] :
? [X6: a > $o] :
( ( X6 @ X5 )
& ! [X7: a] :
( ( X6 @ X7 )
=> ( cK @ X6 @ X7 ) ) )
@ X4 ) ) )
=> ! [X8: a] :
( ? [X9: a > $o] :
( ( X9 @ X8 )
& ! [X10: a] :
( ( X9 @ X10 )
=> ( cK @ X9 @ X10 ) ) )
=> ( cK
@ ^ [X11: a] :
? [X12: a > $o] :
( ( X12 @ X11 )
& ! [X13: a] :
( ( X12 @ X13 )
=> ( cK @ X12 @ X13 ) ) )
@ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a > $o] :
( ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cK @ X2 @ X3 ) ) ) )
=> ! [X1: a] :
( ( cK @ X0 @ X1 )
=> ( cK
@ ^ [X3: a] :
? [X2: a > $o] :
( ( X2 @ X3 )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( cK @ X2 @ X4 ) ) )
@ X1 ) ) )
=> ! [X1: a] :
( ? [X2: a > $o] :
( ( X2 @ X1 )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cK @ X2 @ X3 ) ) )
=> ( cK
@ ^ [X3: a] :
? [X2: a > $o] :
( ( X2 @ X3 )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( cK @ X2 @ X4 ) ) )
@ X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a > $o] :
( ! [X1: a] :
( ( X0 @ X1 )
=> ? [X2: a > $o] :
( ( X2 @ X1 )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cK @ X2 @ X3 ) ) ) )
=> ! [X1: a] :
( ( cK @ X0 @ X1 )
=> ( cK
@ ^ [X3: a] :
? [X2: a > $o] :
( ( X2 @ X3 )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( cK @ X2 @ X4 ) ) )
@ X1 ) ) )
=> ! [X1: a] :
( ? [X2: a > $o] :
( ( X2 @ X1 )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cK @ X2 @ X3 ) ) )
=> ( cK
@ ^ [X3: a] :
? [X2: a > $o] :
( ( X2 @ X3 )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( cK @ X2 @ X4 ) ) )
@ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM116_2SS_pme) ).
thf(f18,plain,
! [X2: a] :
( ( ( sK1 @ X2 )
!= $true )
| ( ( cK @ sK1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f65,plain,
( ! [X0: a > $o,X1: a] :
( ( ( cK @ X0 @ X1 )
!= $true )
| ( ( sK1 @ ( sK2 @ X0 ) )
!= $true )
| ( $true
= ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X1 ) ) )
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ! [X0: a > $o,X1: a] :
( ( ( cK @ X0 @ X1 )
!= $true )
| ( ( sK1 @ ( sK2 @ X0 ) )
!= $true )
| ( $true
= ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X1 ) )
| ( $true != $true ) )
| ~ spl4_1
| ~ spl4_3 ),
inference(superposition,[],[f16,f59]) ).
thf(f59,plain,
( ( ( cK @ sK1 @ ( sK3 @ sK1 ) )
= $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( ( cK @ sK1 @ ( sK3 @ sK1 ) )
= $true )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(superposition,[],[f18,f56]) ).
thf(f56,plain,
( ( ( sK1 @ ( sK3 @ sK1 ) )
= $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f54,plain,
( ( ( sK1 @ ( sK3 @ sK1 ) )
= $true )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(superposition,[],[f43,f27]) ).
thf(f43,plain,
( ! [X0: a > $o] :
( ( ( X0 @ ( sK2 @ sK1 ) )
!= $true )
| ( ( X0 @ ( sK3 @ X0 ) )
= $true ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f16,plain,
! [X3: a > $o,X6: a > $o,X4: a] :
( ( ( cK @ X6 @ ( sK3 @ X6 ) )
!= $true )
| ( ( X6 @ ( sK2 @ X3 ) )
!= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( cK @ X3 @ X4 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f44,plain,
( spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f40,f42,f29]) ).
thf(f40,plain,
! [X0: a > $o] :
( ( ( X0 @ ( sK3 @ X0 ) )
= $true )
| ( ( X0 @ ( sK2 @ sK1 ) )
!= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
! [X0: a > $o] :
( ( ( X0 @ ( sK2 @ sK1 ) )
!= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ( ( X0 @ ( sK3 @ X0 ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f15,f21]) ).
thf(f15,plain,
! [X3: a > $o,X6: a > $o,X4: a] :
( ( ( cK @ X3 @ X4 )
!= $true )
| ( ( X6 @ ( sK3 @ X6 ) )
= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( X6 @ ( sK2 @ X3 ) )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f36,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f35]) ).
thf(f35,plain,
( $false
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f33,plain,
( ( $true != $true )
| ~ spl4_2 ),
inference(superposition,[],[f19,f31]) ).
thf(f31,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f19,plain,
( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f32,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f23,f29,f25]) ).
thf(f23,plain,
( ( ( sK1 @ ( sK2 @ sK1 ) )
= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
( ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ sK0 )
= $true )
| ( ( sK1 @ ( sK2 @ sK1 ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f14,f21]) ).
thf(f14,plain,
! [X3: a > $o,X4: a] :
( ( ( cK @ X3 @ X4 )
!= $true )
| ( ( cK
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y1 @ Y2 )
=> ( cK @ Y1 @ Y2 ) ) )
& ( Y1 @ Y0 ) ) )
@ X4 )
= $true )
| ( ( X3 @ ( sK2 @ X3 ) )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO331^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 09:53:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.37 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.39 % (18012)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.15/0.39 % (18015)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.15/0.39 % (18011)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (18009)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.15/0.39 % (18010)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.15/0.39 % (18008)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.15/0.39 % (18013)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.15/0.39 % (18014)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.39 % (18015)Instruction limit reached!
% 0.15/0.39 % (18015)------------------------------
% 0.15/0.39 % (18015)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (18015)Termination reason: Unknown
% 0.15/0.39 % (18015)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (18015)Memory used [KB]: 1023
% 0.15/0.39 % (18015)Time elapsed: 0.003 s
% 0.15/0.39 % (18015)Instructions burned: 3 (million)
% 0.15/0.39 % (18015)------------------------------
% 0.15/0.39 % (18015)------------------------------
% 0.15/0.39 % (18011)Instruction limit reached!
% 0.15/0.39 % (18011)------------------------------
% 0.15/0.39 % (18011)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (18011)Termination reason: Unknown
% 0.15/0.39 % (18011)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (18012)Instruction limit reached!
% 0.15/0.39 % (18012)------------------------------
% 0.15/0.39 % (18012)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (18012)Termination reason: Unknown
% 0.15/0.39 % (18012)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (18012)Memory used [KB]: 5500
% 0.15/0.39 % (18012)Time elapsed: 0.003 s
% 0.15/0.39 % (18012)Instructions burned: 3 (million)
% 0.15/0.39 % (18012)------------------------------
% 0.15/0.39 % (18012)------------------------------
% 0.15/0.39 % (18011)Memory used [KB]: 895
% 0.15/0.39 % (18011)Time elapsed: 0.002 s
% 0.15/0.39 % (18011)Instructions burned: 2 (million)
% 0.15/0.39 % (18011)------------------------------
% 0.15/0.39 % (18011)------------------------------
% 0.15/0.39 % (18009)Instruction limit reached!
% 0.15/0.39 % (18009)------------------------------
% 0.15/0.39 % (18009)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (18009)Termination reason: Unknown
% 0.15/0.39 % (18009)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (18009)Memory used [KB]: 5500
% 0.15/0.39 % (18009)Time elapsed: 0.004 s
% 0.15/0.39 % (18009)Instructions burned: 4 (million)
% 0.15/0.39 % (18009)------------------------------
% 0.15/0.39 % (18009)------------------------------
% 0.15/0.39 % (18010)First to succeed.
% 0.15/0.40 % (18010)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (18010)------------------------------
% 0.15/0.40 % (18010)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (18010)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (18010)Memory used [KB]: 5628
% 0.15/0.40 % (18010)Time elapsed: 0.011 s
% 0.15/0.40 % (18010)Instructions burned: 10 (million)
% 0.15/0.40 % (18010)------------------------------
% 0.15/0.40 % (18010)------------------------------
% 0.15/0.40 % (18007)Success in time 0.012 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------