TSTP Solution File: SEV060^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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:39 EDT 2024
% Result : Theorem 0.17s 0.35s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 181 ( 90 equ; 0 cnn)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 262 ( 36 ~; 27 |; 36 &; 146 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 84 ( 0 ^ 56 !; 28 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_5,type,
sK0: b ).
thf(func_def_6,type,
sK1: b > a > $o ).
thf(func_def_7,type,
sK2: a ).
thf(func_def_8,type,
sK3: b > a > $o ).
thf(func_def_9,type,
sK4: b ).
thf(func_def_10,type,
sK5: a ).
thf(f29,plain,
$false,
inference(subsumption_resolution,[],[f28,f15]) ).
thf(f15,plain,
( $true
!= ( sK1 @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X4: b,X5: a] :
( ( ( sK0 = X4 )
& ( sK2 = X5 ) )
| ( $true
!= ( sK1 @ X4 @ X5 ) )
| ( ( sK3 @ X4 @ X5 )
= $true ) )
& ( $true
!= ( sK1 @ sK0 @ sK2 ) )
& ( $true
= ( sK1 @ sK4 @ sK5 ) )
& ( $true
!= ( sK3 @ sK4 @ sK5 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: b,X1: b > a > $o,X2: a,X3: b > a > $o] :
( ! [X4: b,X5: a] :
( ( ( X0 = X4 )
& ( X2 = X5 ) )
| ( $true
!= ( X1 @ X4 @ X5 ) )
| ( ( X3 @ X4 @ X5 )
= $true ) )
& ( ( X1 @ X0 @ X2 )
!= $true )
& ? [X6: b,X7: a] :
( ( $true
= ( X1 @ X6 @ X7 ) )
& ( ( X3 @ X6 @ X7 )
!= $true ) ) )
=> ( ! [X5: a,X4: b] :
( ( ( sK0 = X4 )
& ( sK2 = X5 ) )
| ( $true
!= ( sK1 @ X4 @ X5 ) )
| ( ( sK3 @ X4 @ X5 )
= $true ) )
& ( $true
!= ( sK1 @ sK0 @ sK2 ) )
& ? [X7: a,X6: b] :
( ( $true
= ( sK1 @ X6 @ X7 ) )
& ( $true
!= ( sK3 @ X6 @ X7 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X7: a,X6: b] :
( ( $true
= ( sK1 @ X6 @ X7 ) )
& ( $true
!= ( sK3 @ X6 @ X7 ) ) )
=> ( ( $true
= ( sK1 @ sK4 @ sK5 ) )
& ( $true
!= ( sK3 @ sK4 @ sK5 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: b,X1: b > a > $o,X2: a,X3: b > a > $o] :
( ! [X4: b,X5: a] :
( ( ( X0 = X4 )
& ( X2 = X5 ) )
| ( $true
!= ( X1 @ X4 @ X5 ) )
| ( ( X3 @ X4 @ X5 )
= $true ) )
& ( ( X1 @ X0 @ X2 )
!= $true )
& ? [X6: b,X7: a] :
( ( $true
= ( X1 @ X6 @ X7 ) )
& ( ( X3 @ X6 @ X7 )
!= $true ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X3: b,X0: b > a > $o,X1: a,X2: b > a > $o] :
( ! [X5: b,X4: a] :
( ( ( X3 = X5 )
& ( X1 = X4 ) )
| ( $true
!= ( X0 @ X5 @ X4 ) )
| ( $true
= ( X2 @ X5 @ X4 ) ) )
& ( $true
!= ( X0 @ X3 @ X1 ) )
& ? [X6: b,X7: a] :
( ( $true
= ( X0 @ X6 @ X7 ) )
& ( ( X2 @ X6 @ X7 )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X3: b,X1: a,X2: b > a > $o,X0: b > a > $o] :
( ? [X6: b,X7: a] :
( ( $true
= ( X0 @ X6 @ X7 ) )
& ( ( X2 @ X6 @ X7 )
!= $true ) )
& ! [X5: b,X4: a] :
( ( ( X3 = X5 )
& ( X1 = X4 ) )
| ( $true
= ( X2 @ X5 @ X4 ) )
| ( $true
!= ( X0 @ X5 @ X4 ) ) )
& ( $true
!= ( X0 @ X3 @ X1 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X3: b,X1: a,X2: b > a > $o,X0: b > a > $o] :
( ( ! [X5: b,X4: a] :
( ( $true
= ( X0 @ X5 @ X4 ) )
=> ( ( ( X3 = X5 )
& ( X1 = X4 ) )
| ( $true
= ( X2 @ X5 @ X4 ) ) ) )
& ( $true
!= ( X0 @ X3 @ X1 ) ) )
=> ! [X7: a,X6: b] :
( ( $true
= ( X0 @ X6 @ X7 ) )
=> ( ( X2 @ X6 @ X7 )
= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: b > a > $o,X1: a,X2: b > a > $o,X3: b] :
( ( ! [X5: b,X4: a] :
( ( $true
= ( X0 @ X5 @ X4 ) )
=> ( ( ( X3 = X5 )
& ( X1 = X4 ) )
| ( $true
= ( X2 @ X5 @ X4 ) ) ) )
& ( $true
!= ( X0 @ X3 @ X1 ) ) )
=> ! [X7: a,X6: b] :
( ( $true
= ( X0 @ X6 @ X7 ) )
=> ( ( X2 @ X6 @ X7 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: b > a > $o,X1: a,X2: b > a > $o,X3: b] :
( ( ! [X4: a,X5: b] :
( ( X0 @ X5 @ X4 )
=> ( ( X2 @ X5 @ X4 )
| ( ( X3 = X5 )
& ( X1 = X4 ) ) ) )
& ~ ( X0 @ X3 @ X1 ) )
=> ! [X6: b,X7: a] :
( ( X0 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X3: b > a > $o,X1: a,X2: b > a > $o,X0: b] :
( ( ! [X5: a,X4: b] :
( ( X3 @ X4 @ X5 )
=> ( ( X2 @ X4 @ X5 )
| ( ( X0 = X4 )
& ( X1 = X5 ) ) ) )
& ~ ( X3 @ X0 @ X1 ) )
=> ! [X6: b,X7: a] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X3: b > a > $o,X1: a,X2: b > a > $o,X0: b] :
( ( ! [X5: a,X4: b] :
( ( X3 @ X4 @ X5 )
=> ( ( X2 @ X4 @ X5 )
| ( ( X0 = X4 )
& ( X1 = X5 ) ) ) )
& ~ ( X3 @ X0 @ X1 ) )
=> ! [X6: b,X7: a] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM173_pme) ).
thf(f28,plain,
( $true
= ( sK1 @ sK0 @ sK2 ) ),
inference(backward_demodulation,[],[f21,f26]) ).
thf(f26,plain,
sK0 = sK4,
inference(subsumption_resolution,[],[f25,f22]) ).
thf(f22,plain,
( $true
!= ( sK3 @ sK4 @ sK2 ) ),
inference(backward_demodulation,[],[f13,f20]) ).
thf(f20,plain,
sK5 = sK2,
inference(subsumption_resolution,[],[f19,f13]) ).
thf(f19,plain,
( ( sK5 = sK2 )
| ( $true
= ( sK3 @ sK4 @ sK5 ) ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
( ( $true
= ( sK3 @ sK4 @ sK5 ) )
| ( $true != $true )
| ( sK5 = sK2 ) ),
inference(superposition,[],[f16,f14]) ).
thf(f14,plain,
( $true
= ( sK1 @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
! [X4: b,X5: a] :
( ( $true
!= ( sK1 @ X4 @ X5 ) )
| ( sK2 = X5 )
| ( ( sK3 @ X4 @ X5 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f13,plain,
( $true
!= ( sK3 @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f25,plain,
( ( sK0 = sK4 )
| ( $true
= ( sK3 @ sK4 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( $true
= ( sK3 @ sK4 @ sK2 ) )
| ( sK0 = sK4 )
| ( $true != $true ) ),
inference(superposition,[],[f17,f21]) ).
thf(f17,plain,
! [X4: b,X5: a] :
( ( $true
!= ( sK1 @ X4 @ X5 ) )
| ( ( sK3 @ X4 @ X5 )
= $true )
| ( sK0 = X4 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f21,plain,
( $true
= ( sK1 @ sK4 @ sK2 ) ),
inference(backward_demodulation,[],[f14,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.11/0.31 % Computer : n021.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri Jun 21 19:41:09 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.33 This is a TH0_THM_EQU_NAR problem
% 0.17/0.33 Running higher-order theorem proving
% 0.17/0.33 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.17/0.35 % (31040)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.17/0.35 % (31035)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.17/0.35 % (31037)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.17/0.35 % (31040)First to succeed.
% 0.17/0.35 % (31037)Instruction limit reached!
% 0.17/0.35 % (31037)------------------------------
% 0.17/0.35 % (31037)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.17/0.35 % (31037)Termination reason: Unknown
% 0.17/0.35 % (31037)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (31037)Memory used [KB]: 5500
% 0.17/0.35 % (31037)Time elapsed: 0.003 s
% 0.17/0.35 % (31037)Instructions burned: 3 (million)
% 0.17/0.35 % (31037)------------------------------
% 0.17/0.35 % (31037)------------------------------
% 0.17/0.35 % (31035)Instruction limit reached!
% 0.17/0.35 % (31035)------------------------------
% 0.17/0.35 % (31035)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.17/0.35 % (31035)Termination reason: Unknown
% 0.17/0.35 % (31035)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (31035)Memory used [KB]: 5500
% 0.17/0.35 % (31035)Time elapsed: 0.004 s
% 0.17/0.35 % (31035)Instructions burned: 4 (million)
% 0.17/0.35 % (31035)------------------------------
% 0.17/0.35 % (31035)------------------------------
% 0.17/0.35 % (31040)Refutation found. Thanks to Tanya!
% 0.17/0.35 % SZS status Theorem for theBenchmark
% 0.17/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.35 % (31040)------------------------------
% 0.17/0.35 % (31040)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.17/0.35 % (31040)Termination reason: Refutation
% 0.17/0.35
% 0.17/0.35 % (31040)Memory used [KB]: 5500
% 0.17/0.35 % (31040)Time elapsed: 0.004 s
% 0.17/0.35 % (31040)Instructions burned: 2 (million)
% 0.17/0.35 % (31040)------------------------------
% 0.17/0.35 % (31040)------------------------------
% 0.17/0.35 % (31033)Success in time 0.012 s
%------------------------------------------------------------------------------