TSTP Solution File: LCL727^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : LCL727^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n029.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 11:33:22 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 50 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 200 ( 24 ~; 12 |; 15 &; 125 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 109 ( 109 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 0 ^ 51 !; 32 ?; 83 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( a > $o ) > $o ).
thf(func_def_6,type,
sK1: ( a > $o ) > a ).
thf(func_def_7,type,
sK2: ( ( a > $o ) > a ) > a > $o ).
thf(func_def_8,type,
sK3: ( ( a > $o ) > a > $o ) > ( a > $o ) > a ).
thf(func_def_10,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f21,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
$true != $true,
inference(superposition,[],[f15,f18]) ).
thf(f18,plain,
! [X0: ( a > $o ) > a] :
( ( sK2 @ X0 @ ( sK1 @ ( sK2 @ X0 ) ) )
= $true ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f17,plain,
! [X0: ( a > $o ) > a] :
( ( $true != $true )
| ( ( sK2 @ X0 @ ( sK1 @ ( sK2 @ X0 ) ) )
= $true ) ),
inference(superposition,[],[f16,f14]) ).
thf(f14,plain,
! [X3: ( a > $o ) > a] :
( ( sK0 @ ( sK2 @ X3 ) )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X1: a > $o] :
( ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( $true
!= ( sK0 @ X1 ) ) )
& ! [X3: ( a > $o ) > a] :
( ( ( sK2 @ X3 @ ( X3 @ ( sK2 @ X3 ) ) )
!= $true )
& ( ( sK0 @ ( sK2 @ X3 ) )
= $true ) )
& ! [X5: ( a > $o ) > a > $o,X7: a > $o] :
( ! [X8: a] :
( $true
!= ( X5 @ X7 @ X8 ) )
| ( ( X5 @ X7 @ ( sK3 @ X5 @ X7 ) )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f11,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ? [X2: a] :
( $true
= ( X1 @ X2 ) )
| ( ( X0 @ X1 )
!= $true ) )
& ! [X3: ( a > $o ) > a] :
? [X4: a > $o] :
( ( $true
!= ( X4 @ ( X3 @ X4 ) ) )
& ( $true
= ( X0 @ X4 ) ) ) )
=> ( ! [X1: a > $o] :
( ? [X2: a] :
( $true
= ( X1 @ X2 ) )
| ( $true
!= ( sK0 @ X1 ) ) )
& ! [X3: ( a > $o ) > a] :
? [X4: a > $o] :
( ( $true
!= ( X4 @ ( X3 @ X4 ) ) )
& ( ( sK0 @ X4 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X1: a > $o] :
( ? [X2: a] :
( $true
= ( X1 @ X2 ) )
=> ( $true
= ( X1 @ ( sK1 @ X1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X3: ( a > $o ) > a] :
( ? [X4: a > $o] :
( ( $true
!= ( X4 @ ( X3 @ X4 ) ) )
& ( ( sK0 @ X4 )
= $true ) )
=> ( ( ( sK2 @ X3 @ ( X3 @ ( sK2 @ X3 ) ) )
!= $true )
& ( ( sK0 @ ( sK2 @ X3 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X5: ( a > $o ) > a > $o] :
( ? [X6: ( a > $o ) > a] :
! [X7: a > $o] :
( ! [X8: a] :
( $true
!= ( X5 @ X7 @ X8 ) )
| ( ( X5 @ X7 @ ( X6 @ X7 ) )
= $true ) )
=> ! [X7: a > $o] :
( ! [X8: a] :
( $true
!= ( X5 @ X7 @ X8 ) )
| ( ( X5 @ X7 @ ( sK3 @ X5 @ X7 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ? [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ? [X2: a] :
( $true
= ( X1 @ X2 ) )
| ( ( X0 @ X1 )
!= $true ) )
& ! [X3: ( a > $o ) > a] :
? [X4: a > $o] :
( ( $true
!= ( X4 @ ( X3 @ X4 ) ) )
& ( $true
= ( X0 @ X4 ) ) ) )
& ! [X5: ( a > $o ) > a > $o] :
? [X6: ( a > $o ) > a] :
! [X7: a > $o] :
( ! [X8: a] :
( $true
!= ( X5 @ X7 @ X8 ) )
| ( ( X5 @ X7 @ ( X6 @ X7 ) )
= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ? [X4: ( a > $o ) > $o] :
( ! [X5: a > $o] :
( ? [X6: a] :
( ( X5 @ X6 )
= $true )
| ( ( X4 @ X5 )
!= $true ) )
& ! [X7: ( a > $o ) > a] :
? [X8: a > $o] :
( ( $true
!= ( X8 @ ( X7 @ X8 ) ) )
& ( $true
= ( X4 @ X8 ) ) ) )
& ! [X0: ( a > $o ) > a > $o] :
? [X1: ( a > $o ) > a] :
! [X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X2 @ X3 )
!= $true )
| ( ( X0 @ X2 @ ( X1 @ X2 ) )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: ( a > $o ) > a > $o] :
? [X1: ( a > $o ) > a] :
! [X2: a > $o] :
( ? [X3: a] :
( ( X0 @ X2 @ X3 )
= $true )
=> ( ( X0 @ X2 @ ( X1 @ X2 ) )
= $true ) )
=> ! [X4: ( a > $o ) > $o] :
( ! [X5: a > $o] :
( ( ( X4 @ X5 )
= $true )
=> ? [X6: a] :
( ( X5 @ X6 )
= $true ) )
=> ? [X7: ( a > $o ) > a] :
! [X8: a > $o] :
( ( $true
= ( X4 @ X8 ) )
=> ( $true
= ( X8 @ ( X7 @ X8 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: ( a > $o ) > a > $o] :
? [X1: ( a > $o ) > a] :
! [X2: a > $o] :
( ? [X3: a] : ( X0 @ X2 @ X3 )
=> ( X0 @ X2 @ ( X1 @ X2 ) ) )
=> ! [X4: ( a > $o ) > $o] :
( ! [X5: a > $o] :
( ( X4 @ X5 )
=> ? [X6: a] : ( X5 @ X6 ) )
=> ? [X7: ( a > $o ) > a] :
! [X8: a > $o] :
( ( X4 @ X8 )
=> ( X8 @ ( X7 @ X8 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: ( a > $o ) > a > $o] :
? [X1: ( a > $o ) > a] :
! [X2: a > $o] :
( ? [X3: a] : ( X0 @ X2 @ X3 )
=> ( X0 @ X2 @ ( X1 @ X2 ) ) )
=> ! [X4: ( a > $o ) > $o] :
( ! [X5: a > $o] :
( ( X4 @ X5 )
=> ? [X6: a] : ( X5 @ X6 ) )
=> ? [X7: ( a > $o ) > a] :
! [X5: a > $o] :
( ( X4 @ X5 )
=> ( X5 @ ( X7 @ X5 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: ( a > $o ) > a > $o] :
? [X1: ( a > $o ) > a] :
! [X2: a > $o] :
( ? [X3: a] : ( X0 @ X2 @ X3 )
=> ( X0 @ X2 @ ( X1 @ X2 ) ) )
=> ! [X4: ( a > $o ) > $o] :
( ! [X5: a > $o] :
( ( X4 @ X5 )
=> ? [X6: a] : ( X5 @ X6 ) )
=> ? [X7: ( a > $o ) > a] :
! [X5: a > $o] :
( ( X4 @ X5 )
=> ( X5 @ ( X7 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM533) ).
thf(f16,plain,
! [X1: a > $o] :
( ( $true
!= ( sK0 @ X1 ) )
| ( $true
= ( X1 @ ( sK1 @ X1 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
! [X3: ( a > $o ) > a] :
( ( sK2 @ X3 @ ( X3 @ ( sK2 @ X3 ) ) )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL727^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 14:44:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.21/0.36 Running higher-order theorem proving
% 0.21/0.36 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.21/0.37 % (9242)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (9242)Instruction limit reached!
% 0.21/0.37 % (9242)------------------------------
% 0.21/0.37 % (9242)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.37 % (9242)Termination reason: Unknown
% 0.21/0.37 % (9242)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (9242)Memory used [KB]: 5500
% 0.21/0.37 % (9242)Time elapsed: 0.003 s
% 0.21/0.37 % (9242)Instructions burned: 2 (million)
% 0.21/0.37 % (9242)------------------------------
% 0.21/0.37 % (9242)------------------------------
% 0.21/0.38 % (9239)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.21/0.38 % (9240)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.21/0.38 % (9241)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.21/0.38 % (9243)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.21/0.38 % (9244)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.21/0.38 % (9245)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (9243)Instruction limit reached!
% 0.21/0.38 % (9243)------------------------------
% 0.21/0.38 % (9243)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (9243)Termination reason: Unknown
% 0.21/0.38 % (9243)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (9243)Memory used [KB]: 5500
% 0.21/0.38 % (9243)Time elapsed: 0.004 s
% 0.21/0.38 % (9243)Instructions burned: 2 (million)
% 0.21/0.38 % (9243)------------------------------
% 0.21/0.38 % (9243)------------------------------
% 0.21/0.38 % (9241)First to succeed.
% 0.21/0.38 % (9240)Instruction limit reached!
% 0.21/0.38 % (9240)------------------------------
% 0.21/0.38 % (9240)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (9240)Termination reason: Unknown
% 0.21/0.38 % (9240)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (9240)Memory used [KB]: 5500
% 0.21/0.38 % (9240)Time elapsed: 0.006 s
% 0.21/0.38 % (9240)Instructions burned: 4 (million)
% 0.21/0.38 % (9240)------------------------------
% 0.21/0.38 % (9240)------------------------------
% 0.21/0.38 % (9244)Also succeeded, but the first one will report.
% 0.21/0.38 % (9241)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (9241)------------------------------
% 0.21/0.38 % (9241)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (9241)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (9241)Memory used [KB]: 5500
% 0.21/0.38 % (9241)Time elapsed: 0.006 s
% 0.21/0.38 % (9241)Instructions burned: 2 (million)
% 0.21/0.38 % (9241)------------------------------
% 0.21/0.38 % (9241)------------------------------
% 0.21/0.38 % (9238)Success in time 0.019 s
%------------------------------------------------------------------------------