TSTP Solution File: PUZ047^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ047^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 : n009.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 02:27:58 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 43 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 559 ( 156 equ; 0 cnn)
% Maximal formula atoms : 30 ( 18 avg)
% Number of connectives : 1587 ( 77 ~; 55 |; 101 &;1294 @)
% ( 0 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-5 aty)
% Number of variables : 158 ( 0 ^ 154 !; 4 ?; 158 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
cN: a ).
thf(func_def_3,type,
cP: a > a > a > a > b > $o ).
thf(func_def_4,type,
cD: b > b ).
thf(func_def_5,type,
cS: a ).
thf(func_def_6,type,
cG: b > b ).
thf(func_def_7,type,
cW: b > b ).
thf(func_def_8,type,
cL: b > b ).
thf(func_def_9,type,
cO: b ).
thf(f66,plain,
$false,
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
$true != $true,
inference(superposition,[],[f61,f17]) ).
thf(f17,plain,
( ( cP @ cS @ cS @ cS @ cS @ cO )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ! [X0: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cL @ X0 ) ) )
| ( $true
!= ( cP @ cN @ cS @ cN @ cS @ X0 ) ) )
& ! [X1: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ ( cD @ X1 ) ) )
| ( $true
!= ( cP @ cS @ cN @ cS @ cS @ X1 ) ) )
& ! [X2: b] :
( ( $true
= ( cP @ cN @ cS @ cN @ cN @ ( cD @ X2 ) ) )
| ( ( cP @ cS @ cS @ cN @ cS @ X2 )
!= $true ) )
& ! [X3: b] :
( $true
!= ( cP @ cN @ cN @ cN @ cN @ X3 ) )
& ! [X4: b] :
( ( ( cP @ cS @ cS @ cN @ cS @ X4 )
!= $true )
| ( $true
= ( cP @ cN @ cN @ cN @ cS @ ( cW @ X4 ) ) ) )
& ! [X5: b] :
( ( ( cP @ cN @ cN @ cN @ cS @ X5 )
!= $true )
| ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cW @ X5 ) ) ) )
& ! [X6: b] :
( ( ( cP @ cS @ cS @ cN @ cS @ X6 )
!= $true )
| ( $true
= ( cP @ cN @ cS @ cN @ cS @ ( cL @ X6 ) ) ) )
& ( ( cP @ cS @ cS @ cS @ cS @ cO )
= $true )
& ! [X7: a,X8: b,X9: a] :
( ( ( cP @ cS @ X7 @ cS @ X9 @ ( cG @ X8 ) )
= $true )
| ( ( cP @ cN @ X7 @ cN @ X9 @ X8 )
!= $true ) )
& ! [X10: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cS @ ( cD @ X10 ) ) )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X10 ) ) )
& ! [X11: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ ( cW @ X11 ) ) )
| ( ( cP @ cS @ cS @ cS @ cN @ X11 )
!= $true ) )
& ! [X12: b] :
( ( $true
!= ( cP @ cS @ cN @ cS @ cN @ X12 ) )
| ( ( cP @ cN @ cN @ cS @ cN @ ( cL @ X12 ) )
= $true ) )
& ! [X13: a,X14: b,X15: a] :
( ( ( cP @ cN @ X15 @ cN @ X13 @ ( cG @ X14 ) )
= $true )
| ( $true
!= ( cP @ cS @ X15 @ cS @ X13 @ X14 ) ) )
& ! [X16: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cD @ X16 ) ) )
| ( ( cP @ cN @ cS @ cN @ cN @ X16 )
!= $true ) )
& ! [X17: b] :
( ( ( cP @ cS @ cN @ cS @ cN @ ( cL @ X17 ) )
= $true )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X17 ) ) )
& ! [X18: b] :
( ( ( cP @ cN @ cN @ cS @ cN @ X18 )
!= $true )
| ( $true
= ( cP @ cS @ cS @ cS @ cN @ ( cW @ X18 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X17: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cL @ X17 ) ) )
| ( $true
!= ( cP @ cN @ cS @ cN @ cS @ X17 ) ) )
& ! [X15: b] :
( ( ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) )
= $true )
| ( $true
!= ( cP @ cS @ cN @ cS @ cS @ X15 ) ) )
& ! [X1: b] :
( ( $true
= ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) ) )
| ( $true
!= ( cP @ cS @ cS @ cN @ cS @ X1 ) ) )
& ! [X18: b] :
( ( cP @ cN @ cN @ cN @ cN @ X18 )
!= $true )
& ! [X9: b] :
( ( $true
!= ( cP @ cS @ cS @ cN @ cS @ X9 ) )
| ( $true
= ( cP @ cN @ cN @ cN @ cS @ ( cW @ X9 ) ) ) )
& ! [X10: b] :
( ( $true
!= ( cP @ cN @ cN @ cN @ cS @ X10 ) )
| ( ( cP @ cS @ cS @ cN @ cS @ ( cW @ X10 ) )
= $true ) )
& ! [X14: b] :
( ( ( cP @ cS @ cS @ cN @ cS @ X14 )
!= $true )
| ( $true
= ( cP @ cN @ cS @ cN @ cS @ ( cL @ X14 ) ) ) )
& ( ( cP @ cS @ cS @ cS @ cS @ cO )
= $true )
& ! [X11: a,X12: b,X13: a] :
( ( $true
= ( cP @ cS @ X11 @ cS @ X13 @ ( cG @ X12 ) ) )
| ( $true
!= ( cP @ cN @ X11 @ cN @ X13 @ X12 ) ) )
& ! [X2: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cS @ ( cD @ X2 ) ) )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X2 ) ) )
& ! [X5: b] :
( ( ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) )
= $true )
| ( $true
!= ( cP @ cS @ cS @ cS @ cN @ X5 ) ) )
& ! [X3: b] :
( ( $true
!= ( cP @ cS @ cN @ cS @ cN @ X3 ) )
| ( ( cP @ cN @ cN @ cS @ cN @ ( cL @ X3 ) )
= $true ) )
& ! [X7: a,X8: b,X6: a] :
( ( $true
= ( cP @ cN @ X6 @ cN @ X7 @ ( cG @ X8 ) ) )
| ( ( cP @ cS @ X6 @ cS @ X7 @ X8 )
!= $true ) )
& ! [X16: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cD @ X16 ) ) )
| ( ( cP @ cN @ cS @ cN @ cN @ X16 )
!= $true ) )
& ! [X4: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cN @ ( cL @ X4 ) ) )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X4 ) ) )
& ! [X0: b] :
( ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X0 ) )
| ( $true
= ( cP @ cS @ cS @ cS @ cN @ ( cW @ X0 ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ! [X18: b] :
( ( cP @ cN @ cN @ cN @ cN @ X18 )
!= $true )
& ! [X3: b] :
( ( $true
!= ( cP @ cS @ cN @ cS @ cN @ X3 ) )
| ( ( cP @ cN @ cN @ cS @ cN @ ( cL @ X3 ) )
= $true ) )
& ! [X11: a,X12: b,X13: a] :
( ( $true
= ( cP @ cS @ X11 @ cS @ X13 @ ( cG @ X12 ) ) )
| ( $true
!= ( cP @ cN @ X11 @ cN @ X13 @ X12 ) ) )
& ! [X16: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cD @ X16 ) ) )
| ( ( cP @ cN @ cS @ cN @ cN @ X16 )
!= $true ) )
& ! [X4: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cN @ ( cL @ X4 ) ) )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X4 ) ) )
& ! [X2: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cS @ ( cD @ X2 ) ) )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X2 ) ) )
& ! [X5: b] :
( ( ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) )
= $true )
| ( $true
!= ( cP @ cS @ cS @ cS @ cN @ X5 ) ) )
& ! [X7: a,X8: b,X6: a] :
( ( $true
= ( cP @ cN @ X6 @ cN @ X7 @ ( cG @ X8 ) ) )
| ( ( cP @ cS @ X6 @ cS @ X7 @ X8 )
!= $true ) )
& ! [X10: b] :
( ( $true
!= ( cP @ cN @ cN @ cN @ cS @ X10 ) )
| ( ( cP @ cS @ cS @ cN @ cS @ ( cW @ X10 ) )
= $true ) )
& ! [X0: b] :
( ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X0 ) )
| ( $true
= ( cP @ cS @ cS @ cS @ cN @ ( cW @ X0 ) ) ) )
& ! [X17: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cL @ X17 ) ) )
| ( $true
!= ( cP @ cN @ cS @ cN @ cS @ X17 ) ) )
& ( ( cP @ cS @ cS @ cS @ cS @ cO )
= $true )
& ! [X15: b] :
( ( ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) )
= $true )
| ( $true
!= ( cP @ cS @ cN @ cS @ cS @ X15 ) ) )
& ! [X9: b] :
( ( $true
!= ( cP @ cS @ cS @ cN @ cS @ X9 ) )
| ( $true
= ( cP @ cN @ cN @ cN @ cS @ ( cW @ X9 ) ) ) )
& ! [X14: b] :
( ( ( cP @ cS @ cS @ cN @ cS @ X14 )
!= $true )
| ( $true
= ( cP @ cN @ cS @ cN @ cS @ ( cL @ X14 ) ) ) )
& ! [X1: b] :
( ( $true
= ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) ) )
| ( $true
!= ( cP @ cS @ cS @ cN @ cS @ X1 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X3: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cN @ X3 ) )
=> ( ( cP @ cN @ cN @ cS @ cN @ ( cL @ X3 ) )
= $true ) )
& ! [X12: b,X13: a,X11: a] :
( ( $true
= ( cP @ cN @ X11 @ cN @ X13 @ X12 ) )
=> ( $true
= ( cP @ cS @ X11 @ cS @ X13 @ ( cG @ X12 ) ) ) )
& ! [X16: b] :
( ( ( cP @ cN @ cS @ cN @ cN @ X16 )
= $true )
=> ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cD @ X16 ) ) ) )
& ! [X4: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ X4 ) )
=> ( $true
= ( cP @ cS @ cN @ cS @ cN @ ( cL @ X4 ) ) ) )
& ! [X2: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ X2 ) )
=> ( $true
= ( cP @ cS @ cN @ cS @ cS @ ( cD @ X2 ) ) ) )
& ! [X5: b] :
( ( $true
= ( cP @ cS @ cS @ cS @ cN @ X5 ) )
=> ( ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) )
= $true ) )
& ! [X8: b,X7: a,X6: a] :
( ( ( cP @ cS @ X6 @ cS @ X7 @ X8 )
= $true )
=> ( $true
= ( cP @ cN @ X6 @ cN @ X7 @ ( cG @ X8 ) ) ) )
& ! [X10: b] :
( ( $true
= ( cP @ cN @ cN @ cN @ cS @ X10 ) )
=> ( ( cP @ cS @ cS @ cN @ cS @ ( cW @ X10 ) )
= $true ) )
& ! [X0: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ X0 ) )
=> ( $true
= ( cP @ cS @ cS @ cS @ cN @ ( cW @ X0 ) ) ) )
& ! [X17: b] :
( ( $true
= ( cP @ cN @ cS @ cN @ cS @ X17 ) )
=> ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cL @ X17 ) ) ) )
& ( ( cP @ cS @ cS @ cS @ cS @ cO )
= $true )
& ! [X15: b] :
( ( $true
= ( cP @ cS @ cN @ cS @ cS @ X15 ) )
=> ( ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) )
= $true ) )
& ! [X9: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ X9 ) )
=> ( $true
= ( cP @ cN @ cN @ cN @ cS @ ( cW @ X9 ) ) ) )
& ! [X14: b] :
( ( ( cP @ cS @ cS @ cN @ cS @ X14 )
= $true )
=> ( $true
= ( cP @ cN @ cS @ cN @ cS @ ( cL @ X14 ) ) ) )
& ! [X1: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ X1 ) )
=> ( $true
= ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) ) ) ) )
=> ? [X18: b] :
( ( cP @ cN @ cN @ cN @ cN @ X18 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: b] :
( ( cP @ cN @ cN @ cS @ cN @ X0 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X0 ) ) )
& ! [X1: b] :
( ( cP @ cS @ cS @ cN @ cS @ X1 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X1 ) ) )
& ! [X2: b] :
( ( cP @ cN @ cN @ cS @ cN @ X2 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X2 ) ) )
& ! [X3: b] :
( ( cP @ cS @ cN @ cS @ cN @ X3 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X3 ) ) )
& ! [X4: b] :
( ( cP @ cN @ cN @ cS @ cN @ X4 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X4 ) ) )
& ! [X5: b] :
( ( cP @ cS @ cS @ cS @ cN @ X5 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X6: a,X7: a,X8: b] :
( ( cP @ cS @ X6 @ cS @ X7 @ X8 )
=> ( cP @ cN @ X6 @ cN @ X7 @ ( cG @ X8 ) ) )
& ! [X9: b] :
( ( cP @ cS @ cS @ cN @ cS @ X9 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X9 ) ) )
& ! [X10: b] :
( ( cP @ cN @ cN @ cN @ cS @ X10 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X10 ) ) )
& ! [X11: a,X12: b,X13: a] :
( ( cP @ cN @ X11 @ cN @ X13 @ X12 )
=> ( cP @ cS @ X11 @ cS @ X13 @ ( cG @ X12 ) ) )
& ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X14: b] :
( ( cP @ cS @ cS @ cN @ cS @ X14 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X14 ) ) )
& ! [X15: b] :
( ( cP @ cS @ cN @ cS @ cS @ X15 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X15 ) ) )
& ! [X16: b] :
( ( cP @ cN @ cS @ cN @ cN @ X16 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X16 ) ) )
& ! [X17: b] :
( ( cP @ cN @ cS @ cN @ cS @ X17 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X17 ) ) ) )
=> ? [X18: b] : ( cP @ cN @ cN @ cN @ cN @ X18 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X5: b] :
( ( cP @ cN @ cN @ cS @ cN @ X5 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X16: b] :
( ( cP @ cS @ cS @ cN @ cS @ X16 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X16 ) ) )
& ! [X15: b] :
( ( cP @ cN @ cN @ cS @ cN @ X15 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X15 ) ) )
& ! [X0: b] :
( ( cP @ cS @ cN @ cS @ cN @ X0 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X0 ) ) )
& ! [X1: b] :
( ( cP @ cN @ cN @ cS @ cN @ X1 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X1 ) ) )
& ! [X4: b] :
( ( cP @ cS @ cS @ cS @ cN @ X4 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X4 ) ) )
& ! [X8: a,X9: a,X10: b] :
( ( cP @ cS @ X8 @ cS @ X9 @ X10 )
=> ( cP @ cN @ X8 @ cN @ X9 @ ( cG @ X10 ) ) )
& ! [X6: b] :
( ( cP @ cS @ cS @ cN @ cS @ X6 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X6 ) ) )
& ! [X7: b] :
( ( cP @ cN @ cN @ cN @ cS @ X7 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X7 ) ) )
& ! [X11: a,X13: b,X12: a] :
( ( cP @ cN @ X11 @ cN @ X12 @ X13 )
=> ( cP @ cS @ X11 @ cS @ X12 @ ( cG @ X13 ) ) )
& ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X2: b] :
( ( cP @ cS @ cS @ cN @ cS @ X2 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X2 ) ) )
& ! [X14: b] :
( ( cP @ cS @ cN @ cS @ cS @ X14 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X14 ) ) )
& ! [X17: b] :
( ( cP @ cN @ cS @ cN @ cN @ X17 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X17 ) ) )
& ! [X3: b] :
( ( cP @ cN @ cS @ cN @ cS @ X3 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X3 ) ) ) )
=> ? [X18: b] : ( cP @ cN @ cN @ cN @ cN @ X18 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X5: b] :
( ( cP @ cN @ cN @ cS @ cN @ X5 )
=> ( cP @ cS @ cS @ cS @ cN @ ( cW @ X5 ) ) )
& ! [X16: b] :
( ( cP @ cS @ cS @ cN @ cS @ X16 )
=> ( cP @ cN @ cS @ cN @ cN @ ( cD @ X16 ) ) )
& ! [X15: b] :
( ( cP @ cN @ cN @ cS @ cN @ X15 )
=> ( cP @ cS @ cN @ cS @ cS @ ( cD @ X15 ) ) )
& ! [X0: b] :
( ( cP @ cS @ cN @ cS @ cN @ X0 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cL @ X0 ) ) )
& ! [X1: b] :
( ( cP @ cN @ cN @ cS @ cN @ X1 )
=> ( cP @ cS @ cN @ cS @ cN @ ( cL @ X1 ) ) )
& ! [X4: b] :
( ( cP @ cS @ cS @ cS @ cN @ X4 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cW @ X4 ) ) )
& ! [X8: a,X9: a,X10: b] :
( ( cP @ cS @ X8 @ cS @ X9 @ X10 )
=> ( cP @ cN @ X8 @ cN @ X9 @ ( cG @ X10 ) ) )
& ! [X6: b] :
( ( cP @ cS @ cS @ cN @ cS @ X6 )
=> ( cP @ cN @ cN @ cN @ cS @ ( cW @ X6 ) ) )
& ! [X7: b] :
( ( cP @ cN @ cN @ cN @ cS @ X7 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cW @ X7 ) ) )
& ! [X11: a,X13: b,X12: a] :
( ( cP @ cN @ X11 @ cN @ X12 @ X13 )
=> ( cP @ cS @ X11 @ cS @ X12 @ ( cG @ X13 ) ) )
& ( cP @ cS @ cS @ cS @ cS @ cO )
& ! [X2: b] :
( ( cP @ cS @ cS @ cN @ cS @ X2 )
=> ( cP @ cN @ cS @ cN @ cS @ ( cL @ X2 ) ) )
& ! [X14: b] :
( ( cP @ cS @ cN @ cS @ cS @ X14 )
=> ( cP @ cN @ cN @ cS @ cN @ ( cD @ X14 ) ) )
& ! [X17: b] :
( ( cP @ cN @ cS @ cN @ cN @ X17 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cD @ X17 ) ) )
& ! [X3: b] :
( ( cP @ cN @ cS @ cN @ cS @ X3 )
=> ( cP @ cS @ cS @ cN @ cS @ ( cL @ X3 ) ) ) )
=> ? [X18: b] : ( cP @ cN @ cN @ cN @ cN @ X18 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM100A) ).
thf(f61,plain,
! [X0: b] :
( ( cP @ cS @ cS @ cS @ cS @ X0 )
!= $true ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
! [X0: b] :
( ( ( cP @ cS @ cS @ cS @ cS @ X0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f54,f12]) ).
thf(f12,plain,
! [X14: b,X15: a,X13: a] :
( ( ( cP @ cN @ X15 @ cN @ X13 @ ( cG @ X14 ) )
= $true )
| ( $true
!= ( cP @ cS @ X15 @ cS @ X13 @ X14 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f54,plain,
! [X0: b] :
( $true
!= ( cP @ cN @ cS @ cN @ cS @ X0 ) ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
! [X0: b] :
( ( $true
!= ( cP @ cN @ cS @ cN @ cS @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f42,f24]) ).
thf(f24,plain,
! [X0: b] :
( ( $true
= ( cP @ cS @ cS @ cN @ cS @ ( cL @ X0 ) ) )
| ( $true
!= ( cP @ cN @ cS @ cN @ cS @ X0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f42,plain,
! [X0: b] :
( $true
!= ( cP @ cS @ cS @ cN @ cS @ X0 ) ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
! [X0: b] :
( ( $true != $true )
| ( $true
!= ( cP @ cS @ cS @ cN @ cS @ X0 ) ) ),
inference(superposition,[],[f37,f22]) ).
thf(f22,plain,
! [X2: b] :
( ( $true
= ( cP @ cN @ cS @ cN @ cN @ ( cD @ X2 ) ) )
| ( ( cP @ cS @ cS @ cN @ cS @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f37,plain,
! [X0: b] :
( ( cP @ cN @ cS @ cN @ cN @ X0 )
!= $true ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
! [X0: b] :
( ( ( cP @ cN @ cS @ cN @ cN @ X0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f32,f16]) ).
thf(f16,plain,
! [X8: b,X9: a,X7: a] :
( ( ( cP @ cS @ X7 @ cS @ X9 @ ( cG @ X8 ) )
= $true )
| ( ( cP @ cN @ X7 @ cN @ X9 @ X8 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f32,plain,
! [X0: b] :
( $true
!= ( cP @ cS @ cS @ cS @ cN @ X0 ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
! [X0: b] :
( ( $true != $true )
| ( $true
!= ( cP @ cS @ cS @ cS @ cN @ X0 ) ) ),
inference(superposition,[],[f28,f14]) ).
thf(f14,plain,
! [X11: b] :
( ( $true
= ( cP @ cN @ cN @ cS @ cN @ ( cW @ X11 ) ) )
| ( ( cP @ cS @ cS @ cS @ cN @ X11 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f28,plain,
! [X0: b] :
( $true
!= ( cP @ cN @ cN @ cS @ cN @ X0 ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f27,plain,
! [X0: b] :
( ( $true != $true )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X0 ) ) ),
inference(superposition,[],[f26,f10]) ).
thf(f10,plain,
! [X17: b] :
( ( ( cP @ cS @ cN @ cS @ cN @ ( cL @ X17 ) )
= $true )
| ( $true
!= ( cP @ cN @ cN @ cS @ cN @ X17 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f26,plain,
! [X0: b] :
( ( cP @ cS @ cN @ cS @ cN @ X0 )
!= $true ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f25,plain,
! [X0: b] :
( ( $true != $true )
| ( ( cP @ cS @ cN @ cS @ cN @ X0 )
!= $true ) ),
inference(superposition,[],[f21,f12]) ).
thf(f21,plain,
! [X3: b] :
( $true
!= ( cP @ cN @ cN @ cN @ cN @ X3 ) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ047^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 : n009.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 : Sat May 18 11:00:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 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.37 % (9011)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.37 % (9006)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.37 % (9007)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.37 % (9008)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.37 % (9009)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (9010)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (9011)First to succeed.
% 0.14/0.37 % (9012)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (9013)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.37 % (9009)Instruction limit reached!
% 0.14/0.37 % (9009)------------------------------
% 0.14/0.37 % (9009)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (9009)Termination reason: Unknown
% 0.14/0.37 % (9009)Termination phase: shuffling
% 0.14/0.37 % (9010)Instruction limit reached!
% 0.14/0.37 % (9010)------------------------------
% 0.14/0.37 % (9010)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (9010)Termination reason: Unknown
% 0.14/0.37 % (9010)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (9010)Memory used [KB]: 1023
% 0.14/0.37 % (9010)Time elapsed: 0.003 s
% 0.14/0.37 % (9010)Instructions burned: 2 (million)
% 0.14/0.37 % (9010)------------------------------
% 0.14/0.37 % (9010)------------------------------
% 0.14/0.37
% 0.14/0.37 % (9009)Memory used [KB]: 895
% 0.14/0.37 % (9009)Time elapsed: 0.003 s
% 0.14/0.37 % (9009)Instructions burned: 2 (million)
% 0.14/0.37 % (9009)------------------------------
% 0.14/0.37 % (9009)------------------------------
% 0.14/0.37 % (9007)Instruction limit reached!
% 0.14/0.37 % (9007)------------------------------
% 0.14/0.37 % (9007)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (9007)Termination reason: Unknown
% 0.14/0.37 % (9007)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (9007)Memory used [KB]: 895
% 0.14/0.37 % (9007)Time elapsed: 0.004 s
% 0.14/0.37 % (9007)Instructions burned: 4 (million)
% 0.14/0.37 % (9007)------------------------------
% 0.14/0.37 % (9007)------------------------------
% 0.14/0.37 % (9013)Instruction limit reached!
% 0.14/0.37 % (9013)------------------------------
% 0.14/0.37 % (9013)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (9013)Termination reason: Unknown
% 0.14/0.37 % (9013)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (9013)Memory used [KB]: 895
% 0.14/0.37 % (9013)Time elapsed: 0.004 s
% 0.14/0.37 % (9013)Instructions burned: 3 (million)
% 0.14/0.37 % (9013)------------------------------
% 0.14/0.37 % (9013)------------------------------
% 0.14/0.37 % (9011)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (9011)------------------------------
% 0.14/0.38 % (9011)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9011)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (9011)Memory used [KB]: 5628
% 0.14/0.38 % (9011)Time elapsed: 0.009 s
% 0.14/0.38 % (9011)Instructions burned: 14 (million)
% 0.14/0.38 % (9011)------------------------------
% 0.14/0.38 % (9011)------------------------------
% 0.14/0.38 % (9005)Success in time 0.005 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------