TSTP Solution File: SEV045^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV045^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n023.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 : Mon Jun 24 16:01:36 EDT 2024
% Result : Theorem 0.13s 0.34s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of formulae : 54 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 670 ( 195 equ; 0 cnn)
% Maximal formula atoms : 19 ( 12 avg)
% Number of connectives : 1032 ( 145 ~; 118 |; 54 &; 661 @)
% ( 1 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 193 ( 0 ^ 185 !; 8 ?; 193 :)
% 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,
g: a > b ).
thf(func_def_3,type,
f: a > b ).
thf(func_def_4,type,
cQ: a > b > b > $o ).
thf(func_def_5,type,
cP: a > a > $o ).
thf(func_def_9,type,
sK0: a ).
thf(func_def_10,type,
sK1: a ).
thf(func_def_12,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f321,plain,
$false,
inference(avatar_sat_refutation,[],[f55,f320]) ).
thf(f320,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f319]) ).
thf(f319,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f314]) ).
thf(f314,plain,
( ( $true != $true )
| ~ spl2_1 ),
inference(superposition,[],[f313,f16]) ).
thf(f16,plain,
( $true
= ( cP @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X0: a,X1: a,X2: a] :
( ( ( cP @ X2 @ X0 )
= $true )
| ( ( cP @ X1 @ X0 )
!= $true )
| ( ( cP @ X2 @ X1 )
!= $true ) )
& ! [X3: a,X4: a] :
( ( ( cP @ X4 @ X3 )
!= $true )
| ( $true
= ( cP @ X3 @ X4 ) ) )
& ( $true
!= ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) ) )
& ( $true
= ( cP @ sK1 @ sK0 ) )
& ! [X7: a] :
( ( ! [X8: b,X9: b,X10: b] :
( ( ( cQ @ X7 @ X10 @ X9 )
!= $true )
| ( ( cQ @ X7 @ X10 @ X8 )
= $true )
| ( ( cQ @ X7 @ X9 @ X8 )
!= $true ) )
& ! [X11: b,X12: b] :
( ( ( cQ @ X7 @ X11 @ X12 )
= $true )
| ( ( cQ @ X7 @ X12 @ X11 )
!= $true ) ) )
| ( ( cP @ X7 @ X7 )
!= $true ) )
& ! [X13: a] :
( ( ( cQ @ X13 @ ( f @ X13 ) @ ( g @ X13 ) )
= $true )
| ( ( cP @ X13 @ X13 )
!= $true ) )
& ! [X14: a,X15: a] :
( ( ( cQ @ X14 )
= ( cQ @ X15 ) )
| ( ( cP @ X14 @ X15 )
!= $true ) )
& ! [X16: a,X17: a] :
( ( ( cP @ X17 @ X16 )
!= $true )
| ( ( cQ @ X17 @ ( f @ X17 ) @ ( f @ X16 ) )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9]) ).
thf(f9,plain,
( ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ ( f @ X6 ) @ ( g @ X5 ) )
!= $true )
& ( ( cP @ X6 @ X5 )
= $true ) )
=> ( ( $true
!= ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) ) )
& ( $true
= ( cP @ sK1 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: a,X1: a,X2: a] :
( ( ( cP @ X2 @ X0 )
= $true )
| ( ( cP @ X1 @ X0 )
!= $true )
| ( ( cP @ X2 @ X1 )
!= $true ) )
& ! [X3: a,X4: a] :
( ( ( cP @ X4 @ X3 )
!= $true )
| ( $true
= ( cP @ X3 @ X4 ) ) )
& ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ ( f @ X6 ) @ ( g @ X5 ) )
!= $true )
& ( ( cP @ X6 @ X5 )
= $true ) )
& ! [X7: a] :
( ( ! [X8: b,X9: b,X10: b] :
( ( ( cQ @ X7 @ X10 @ X9 )
!= $true )
| ( ( cQ @ X7 @ X10 @ X8 )
= $true )
| ( ( cQ @ X7 @ X9 @ X8 )
!= $true ) )
& ! [X11: b,X12: b] :
( ( ( cQ @ X7 @ X11 @ X12 )
= $true )
| ( ( cQ @ X7 @ X12 @ X11 )
!= $true ) ) )
| ( ( cP @ X7 @ X7 )
!= $true ) )
& ! [X13: a] :
( ( ( cQ @ X13 @ ( f @ X13 ) @ ( g @ X13 ) )
= $true )
| ( ( cP @ X13 @ X13 )
!= $true ) )
& ! [X14: a,X15: a] :
( ( ( cQ @ X14 )
= ( cQ @ X15 ) )
| ( ( cP @ X14 @ X15 )
!= $true ) )
& ! [X16: a,X17: a] :
( ( ( cP @ X17 @ X16 )
!= $true )
| ( ( cQ @ X17 @ ( f @ X17 ) @ ( f @ X16 ) )
= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X3: a,X4: a,X5: a] :
( ( $true
= ( cP @ X5 @ X3 ) )
| ( ( cP @ X4 @ X3 )
!= $true )
| ( $true
!= ( cP @ X5 @ X4 ) ) )
& ! [X6: a,X7: a] :
( ( $true
!= ( cP @ X7 @ X6 ) )
| ( $true
= ( cP @ X6 @ X7 ) ) )
& ? [X16: a,X17: a] :
( ( ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X16 ) )
!= $true )
& ( ( cP @ X17 @ X16 )
= $true ) )
& ! [X10: a] :
( ( ! [X15: b,X14: b,X13: b] :
( ( ( cQ @ X10 @ X13 @ X14 )
!= $true )
| ( ( cQ @ X10 @ X13 @ X15 )
= $true )
| ( $true
!= ( cQ @ X10 @ X14 @ X15 ) ) )
& ! [X12: b,X11: b] :
( ( ( cQ @ X10 @ X12 @ X11 )
= $true )
| ( ( cQ @ X10 @ X11 @ X12 )
!= $true ) ) )
| ( ( cP @ X10 @ X10 )
!= $true ) )
& ! [X0: a] :
( ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true )
| ( ( cP @ X0 @ X0 )
!= $true ) )
& ! [X9: a,X8: a] :
( ( ( cQ @ X8 )
= ( cQ @ X9 ) )
| ( ( cP @ X9 @ X8 )
!= $true ) )
& ! [X1: a,X2: a] :
( ( ( cP @ X2 @ X1 )
!= $true )
| ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X16: a,X17: a] :
( ( ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X16 ) )
!= $true )
& ( ( cP @ X17 @ X16 )
= $true ) )
& ! [X10: a] :
( ( ! [X12: b,X11: b] :
( ( ( cQ @ X10 @ X12 @ X11 )
= $true )
| ( ( cQ @ X10 @ X11 @ X12 )
!= $true ) )
& ! [X13: b,X14: b,X15: b] :
( ( ( cQ @ X10 @ X13 @ X15 )
= $true )
| ( ( cQ @ X10 @ X13 @ X14 )
!= $true )
| ( $true
!= ( cQ @ X10 @ X14 @ X15 ) ) ) )
| ( ( cP @ X10 @ X10 )
!= $true ) )
& ! [X9: a,X8: a] :
( ( ( cQ @ X8 )
= ( cQ @ X9 ) )
| ( ( cP @ X9 @ X8 )
!= $true ) )
& ! [X6: a,X7: a] :
( ( $true
!= ( cP @ X7 @ X6 ) )
| ( $true
= ( cP @ X6 @ X7 ) ) )
& ! [X5: a,X4: a,X3: a] :
( ( $true
= ( cP @ X5 @ X3 ) )
| ( ( cP @ X4 @ X3 )
!= $true )
| ( $true
!= ( cP @ X5 @ X4 ) ) )
& ! [X1: a,X2: a] :
( ( ( cP @ X2 @ X1 )
!= $true )
| ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true ) )
& ! [X0: a] :
( ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true )
| ( ( cP @ X0 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a] :
( ( ( cP @ X0 @ X0 )
= $true )
=> ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true ) )
=> ( ! [X1: a,X2: a] :
( ( ( cP @ X2 @ X1 )
= $true )
=> ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true ) )
=> ( ( ! [X6: a,X7: a] :
( ( $true
= ( cP @ X7 @ X6 ) )
=> ( $true
= ( cP @ X6 @ X7 ) ) )
& ! [X5: a,X4: a,X3: a] :
( ( ( ( cP @ X4 @ X3 )
= $true )
& ( $true
= ( cP @ X5 @ X4 ) ) )
=> ( $true
= ( cP @ X5 @ X3 ) ) ) )
=> ( ( ! [X10: a] :
( ( ( cP @ X10 @ X10 )
= $true )
=> ( ! [X11: b,X12: b] :
( ( ( cQ @ X10 @ X11 @ X12 )
= $true )
=> ( ( cQ @ X10 @ X12 @ X11 )
= $true ) )
& ! [X13: b,X14: b,X15: b] :
( ( ( ( cQ @ X10 @ X13 @ X14 )
= $true )
& ( $true
= ( cQ @ X10 @ X14 @ X15 ) ) )
=> ( ( cQ @ X10 @ X13 @ X15 )
= $true ) ) ) )
& ! [X8: a,X9: a] :
( ( ( cP @ X9 @ X8 )
= $true )
=> ( ( cQ @ X8 )
= ( cQ @ X9 ) ) ) )
=> ! [X17: a,X16: a] :
( ( ( cP @ X17 @ X16 )
= $true )
=> ( ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X16 ) )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X2: a] :
( ( cP @ X2 @ X1 )
=> ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) ) )
=> ( ( ! [X3: a,X4: a,X5: a] :
( ( ( cP @ X5 @ X4 )
& ( cP @ X4 @ X3 ) )
=> ( cP @ X5 @ X3 ) )
& ! [X6: a,X7: a] :
( ( cP @ X7 @ X6 )
=> ( cP @ X6 @ X7 ) ) )
=> ( ( ! [X8: a,X9: a] :
( ( cP @ X9 @ X8 )
=> ( ( cQ @ X8 )
= ( cQ @ X9 ) ) )
& ! [X10: a] :
( ( cP @ X10 @ X10 )
=> ( ! [X11: b,X12: b] :
( ( cQ @ X10 @ X11 @ X12 )
=> ( cQ @ X10 @ X12 @ X11 ) )
& ! [X13: b,X14: b,X15: b] :
( ( ( cQ @ X10 @ X14 @ X15 )
& ( cQ @ X10 @ X13 @ X14 ) )
=> ( cQ @ X10 @ X13 @ X15 ) ) ) ) )
=> ! [X16: a,X17: a] :
( ( cP @ X17 @ X16 )
=> ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X16 ) ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X2: a,X1: a,X0: a] :
( ( ( cP @ X0 @ X1 )
& ( cP @ X1 @ X2 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) )
& ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X3: b,X1: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) )
& ! [X3: b,X1: b,X2: b] :
( ( ( cQ @ X0 @ X1 @ X2 )
& ( cQ @ X0 @ X3 @ X1 ) )
=> ( cQ @ X0 @ X3 @ X2 ) ) ) ) )
=> ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X2: a,X1: a,X0: a] :
( ( ( cP @ X0 @ X1 )
& ( cP @ X1 @ X2 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) )
& ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X3: b,X1: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) )
& ! [X3: b,X1: b,X2: b] :
( ( ( cQ @ X0 @ X1 @ X2 )
& ( cQ @ X0 @ X3 @ X1 ) )
=> ( cQ @ X0 @ X3 @ X2 ) ) ) ) )
=> ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM509_pme) ).
thf(f313,plain,
( ! [X0: a] :
( ( cP @ X0 @ sK0 )
!= $true )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f311,f18]) ).
thf(f18,plain,
! [X3: a,X4: a] :
( ( $true
= ( cP @ X3 @ X4 ) )
| ( ( cP @ X4 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f311,plain,
( ! [X0: a] :
( ( $true
!= ( cP @ sK0 @ X0 ) )
| ( ( cP @ X0 @ sK0 )
!= $true ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f309]) ).
thf(f309,plain,
( ! [X0: a] :
( ( $true != $true )
| ( ( cP @ X0 @ sK0 )
!= $true )
| ( $true
!= ( cP @ sK0 @ X0 ) ) )
| ~ spl2_1 ),
inference(superposition,[],[f308,f19]) ).
thf(f19,plain,
! [X2: a,X0: a,X1: a] :
( ( ( cP @ X2 @ X0 )
= $true )
| ( ( cP @ X1 @ X0 )
!= $true )
| ( ( cP @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f308,plain,
( ( ( cP @ sK0 @ sK0 )
!= $true )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f307,f16]) ).
thf(f307,plain,
( ( ( cP @ sK0 @ sK0 )
!= $true )
| ( $true
!= ( cP @ sK1 @ sK0 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f306]) ).
thf(f306,plain,
( ( $true != $true )
| ( $true
!= ( cP @ sK1 @ sK0 ) )
| ( ( cP @ sK0 @ sK0 )
!= $true )
| ~ spl2_1 ),
inference(duplicate_literal_removal,[],[f293]) ).
thf(f293,plain,
( ( ( cP @ sK0 @ sK0 )
!= $true )
| ( $true != $true )
| ( $true
!= ( cP @ sK1 @ sK0 ) )
| ( $true
!= ( cP @ sK1 @ sK0 ) )
| ~ spl2_1 ),
inference(superposition,[],[f115,f169]) ).
thf(f169,plain,
! [X0: a,X1: a] :
( ( $true
= ( cQ @ X1 @ ( f @ X0 ) @ ( g @ X0 ) ) )
| ( ( cP @ X0 @ X0 )
!= $true )
| ( ( cP @ X1 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f150]) ).
thf(f150,plain,
! [X0: a,X1: a] :
( ( $false = $true )
| ( $true
= ( cQ @ X1 @ ( f @ X0 ) @ ( g @ X0 ) ) )
| ( ( cP @ X0 @ X0 )
!= $true )
| ( ( cP @ X1 @ X0 )
!= $true ) ),
inference(superposition,[],[f13,f30]) ).
thf(f30,plain,
! [X16: b,X14: a,X17: b,X15: a] :
( ( $false
= ( cQ @ X15 @ X16 @ X17 ) )
| ( ( cP @ X14 @ X15 )
!= $true )
| ( ( cQ @ X14 @ X16 @ X17 )
= $true ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
! [X16: b,X14: a,X17: b,X15: a] :
( ( ( cQ @ X14 @ X16 @ X17 )
= ( cQ @ X15 @ X16 @ X17 ) )
| ( ( cP @ X14 @ X15 )
!= $true ) ),
inference(argument_congruence,[],[f20]) ).
thf(f20,plain,
! [X16: b,X14: a,X15: a] :
( ( ( cQ @ X15 @ X16 )
= ( cQ @ X14 @ X16 ) )
| ( ( cP @ X14 @ X15 )
!= $true ) ),
inference(argument_congruence,[],[f12]) ).
thf(f12,plain,
! [X14: a,X15: a] :
( ( ( cQ @ X14 )
= ( cQ @ X15 ) )
| ( ( cP @ X14 @ X15 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
! [X13: a] :
( ( ( cQ @ X13 @ ( f @ X13 ) @ ( g @ X13 ) )
= $true )
| ( ( cP @ X13 @ X13 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f115,plain,
( ! [X0: a] :
( ( ( cQ @ sK1 @ ( f @ X0 ) @ ( g @ sK0 ) )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f112,f36]) ).
thf(f36,plain,
( ( ( cP @ sK1 @ sK1 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl2_1
<=> ( ( cP @ sK1 @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f112,plain,
( ! [X0: a] :
( ( ( cQ @ sK1 @ ( f @ X0 ) @ ( g @ sK0 ) )
!= $true )
| ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f111]) ).
thf(f111,plain,
( ! [X0: a] :
( ( $true != $true )
| ( ( cQ @ sK1 @ ( f @ X0 ) @ ( g @ sK0 ) )
!= $true )
| ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(superposition,[],[f80,f14]) ).
thf(f14,plain,
! [X11: b,X7: a,X12: b] :
( ( ( cQ @ X7 @ X11 @ X12 )
= $true )
| ( ( cP @ X7 @ X7 )
!= $true )
| ( ( cQ @ X7 @ X12 @ X11 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f80,plain,
( ! [X0: a] :
( ( ( cQ @ sK1 @ ( g @ sK0 ) @ ( f @ X0 ) )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ! [X0: a] :
( ( ( cQ @ sK1 @ ( g @ sK0 ) @ ( f @ X0 ) )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true )
| ( $true != $true ) )
| ~ spl2_1 ),
inference(superposition,[],[f68,f11]) ).
thf(f11,plain,
! [X16: a,X17: a] :
( ( ( cQ @ X17 @ ( f @ X17 ) @ ( f @ X16 ) )
= $true )
| ( ( cP @ X17 @ X16 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f68,plain,
( ! [X0: b] :
( ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true )
| ( ( cQ @ sK1 @ ( g @ sK0 ) @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f65,f36]) ).
thf(f65,plain,
( ! [X0: b] :
( ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true )
| ( ( cQ @ sK1 @ ( g @ sK0 ) @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ! [X0: b] :
( ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cQ @ sK1 @ ( g @ sK0 ) @ X0 )
!= $true )
| ( $true != $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(superposition,[],[f57,f14]) ).
thf(f57,plain,
( ! [X0: b] :
( ( $true
!= ( cQ @ sK1 @ X0 @ ( g @ sK0 ) ) )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true ) )
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f44,f36]) ).
thf(f44,plain,
! [X0: b] :
( ( ( cP @ sK1 @ sK1 )
!= $true )
| ( $true
!= ( cQ @ sK1 @ X0 @ ( g @ sK0 ) ) )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
! [X0: b] :
( ( $true
!= ( cQ @ sK1 @ X0 @ ( g @ sK0 ) ) )
| ( $true != $true )
| ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
!= $true ) ),
inference(superposition,[],[f17,f15]) ).
thf(f15,plain,
! [X10: b,X8: b,X9: b,X7: a] :
( ( ( cQ @ X7 @ X10 @ X8 )
= $true )
| ( ( cQ @ X7 @ X10 @ X9 )
!= $true )
| ( ( cP @ X7 @ X7 )
!= $true )
| ( ( cQ @ X7 @ X9 @ X8 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f17,plain,
( $true
!= ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f55,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f54]) ).
thf(f54,plain,
( $false
| spl2_1 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( $true != $true )
| spl2_1 ),
inference(superposition,[],[f49,f16]) ).
thf(f49,plain,
( ! [X0: a] :
( ( cP @ sK1 @ X0 )
!= $true )
| spl2_1 ),
inference(subsumption_resolution,[],[f47,f18]) ).
thf(f47,plain,
( ! [X0: a] :
( ( ( cP @ X0 @ sK1 )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ! [X0: a] :
( ( $true != $true )
| ( ( cP @ X0 @ sK1 )
!= $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) )
| spl2_1 ),
inference(superposition,[],[f37,f19]) ).
thf(f37,plain,
( ( ( cP @ sK1 @ sK1 )
!= $true )
| spl2_1 ),
inference(avatar_component_clause,[],[f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV045^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.09 % Command : run_vampire %s %d THM
% 0.08/0.28 % Computer : n023.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri Jun 21 18:57:54 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.29 This is a TH0_THM_EQU_NAR problem
% 0.08/0.29 Running higher-order theorem proving
% 0.08/0.29 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.08/0.31 % (2887)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.08/0.31 % (2890)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.08/0.31 % (2889)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.08/0.31 % (2891)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.08/0.31 % (2893)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.08/0.31 % (2892)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.08/0.31 % (2890)Instruction limit reached!
% 0.08/0.31 % (2890)------------------------------
% 0.08/0.31 % (2890)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.08/0.31 % (2890)Termination reason: Unknown
% 0.08/0.31 % (2890)Termination phase: Property scanning
% 0.08/0.31
% 0.08/0.31 % (2890)Memory used [KB]: 895
% 0.08/0.31 % (2890)Time elapsed: 0.002 s
% 0.08/0.31 % (2890)Instructions burned: 2 (million)
% 0.08/0.31 % (2890)------------------------------
% 0.08/0.31 % (2890)------------------------------
% 0.08/0.31 % (2888)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.08/0.31 % (2891)Instruction limit reached!
% 0.08/0.31 % (2891)------------------------------
% 0.08/0.31 % (2891)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.08/0.31 % (2891)Termination reason: Unknown
% 0.08/0.31 % (2891)Termination phase: Saturation
% 0.08/0.31
% 0.08/0.31 % (2891)Memory used [KB]: 1023
% 0.08/0.31 % (2891)Time elapsed: 0.003 s
% 0.08/0.31 % (2891)Instructions burned: 3 (million)
% 0.08/0.31 % (2891)------------------------------
% 0.08/0.31 % (2891)------------------------------
% 0.08/0.31 % (2888)Instruction limit reached!
% 0.08/0.31 % (2888)------------------------------
% 0.08/0.31 % (2888)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.08/0.31 % (2888)Termination reason: Unknown
% 0.08/0.31 % (2888)Termination phase: Saturation
% 0.08/0.31
% 0.08/0.31 % (2888)Memory used [KB]: 5500
% 0.08/0.31 % (2888)Time elapsed: 0.004 s
% 0.08/0.31 % (2888)Instructions burned: 4 (million)
% 0.08/0.31 % (2888)------------------------------
% 0.08/0.31 % (2888)------------------------------
% 0.13/0.32 % (2893)Instruction limit reached!
% 0.13/0.32 % (2893)------------------------------
% 0.13/0.32 % (2893)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.32 % (2893)Termination reason: Unknown
% 0.13/0.32 % (2893)Termination phase: Saturation
% 0.13/0.32
% 0.13/0.32 % (2893)Memory used [KB]: 5628
% 0.13/0.32 % (2893)Time elapsed: 0.012 s
% 0.13/0.32 % (2893)Instructions burned: 18 (million)
% 0.13/0.32 % (2893)------------------------------
% 0.13/0.32 % (2893)------------------------------
% 0.13/0.33 % (2894)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.13/0.33 % (2889)Instruction limit reached!
% 0.13/0.33 % (2889)------------------------------
% 0.13/0.33 % (2889)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.33 % (2889)Termination reason: Unknown
% 0.13/0.33 % (2889)Termination phase: Saturation
% 0.13/0.33
% 0.13/0.33 % (2889)Memory used [KB]: 5628
% 0.13/0.33 % (2889)Time elapsed: 0.017 s
% 0.13/0.33 % (2889)Instructions burned: 27 (million)
% 0.13/0.33 % (2889)------------------------------
% 0.13/0.33 % (2889)------------------------------
% 0.13/0.33 % (2894)Instruction limit reached!
% 0.13/0.33 % (2894)------------------------------
% 0.13/0.33 % (2894)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.33 % (2894)Termination reason: Unknown
% 0.13/0.33 % (2894)Termination phase: Saturation
% 0.13/0.33
% 0.13/0.33 % (2894)Memory used [KB]: 5500
% 0.13/0.33 % (2894)Time elapsed: 0.003 s
% 0.13/0.33 % (2894)Instructions burned: 3 (million)
% 0.13/0.33 % (2894)------------------------------
% 0.13/0.33 % (2894)------------------------------
% 0.13/0.33 % (2895)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.13/0.33 % (2896)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.13/0.33 % (2887)First to succeed.
% 0.13/0.34 % (2887)Refutation found. Thanks to Tanya!
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.34 % (2887)------------------------------
% 0.13/0.34 % (2887)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.34 % (2887)Termination reason: Refutation
% 0.13/0.34
% 0.13/0.34 % (2887)Memory used [KB]: 5884
% 0.13/0.34 % (2887)Time elapsed: 0.030 s
% 0.13/0.34 % (2887)Instructions burned: 80 (million)
% 0.13/0.34 % (2887)------------------------------
% 0.13/0.34 % (2887)------------------------------
% 0.13/0.34 % (2886)Success in time 0.035 s
%------------------------------------------------------------------------------