TSTP Solution File: SEU850^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU850^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 : n020.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 03:51:55 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 51 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 350 ( 128 equ; 0 cnn)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 317 ( 63 ~; 60 |; 48 &; 123 @)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 54 ( 0 ^ 24 !; 30 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a ).
thf(func_def_8,type,
sK4: a ).
thf(func_def_9,type,
sK5: a ).
thf(f53,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f46,f47,f48,f49,f50,f51,f52]) ).
thf(f52,plain,
( ~ spl6_1
| ~ spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f29,f38,f42,f34]) ).
thf(f34,plain,
( spl6_1
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f42,plain,
( spl6_3
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f38,plain,
( spl6_2
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f29,plain,
( ( $true
!= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
!= ( sK1 @ sK5 ) ) ),
inference(definition_unfolding,[],[f19,f14,f24,f14]) ).
thf(f24,plain,
sK1 = sK2,
inference(definition_unfolding,[],[f15,f14]) ).
thf(f15,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( ( $true
!= ( sK1 @ sK3 ) )
& ( $true
= ( sK0 @ sK3 ) ) )
| ( ( ( sK2 @ sK4 )
!= $true )
& ( $true
= ( sK1 @ sK4 ) ) )
| ( ( $true
!= ( sK0 @ sK5 ) )
& ( $true
= ( sK2 @ sK5 ) ) ) )
& ( sK0 = sK2 )
& ( sK0 = sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X1 @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( $true
!= ( X2 @ X4 ) )
& ( $true
= ( X1 @ X4 ) ) )
| ? [X5: a] :
( ( $true
!= ( X0 @ X5 ) )
& ( $true
= ( X2 @ X5 ) ) ) )
& ( X0 = X2 )
& ( X0 = X1 ) )
=> ( ( ? [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
& ( $true
= ( sK0 @ X3 ) ) )
| ? [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
& ( $true
= ( sK1 @ X4 ) ) )
| ? [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
& ( $true
= ( sK2 @ X5 ) ) ) )
& ( sK0 = sK2 )
& ( sK0 = sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
& ( $true
= ( sK0 @ X3 ) ) )
=> ( ( $true
!= ( sK1 @ sK3 ) )
& ( $true
= ( sK0 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
& ( $true
= ( sK1 @ X4 ) ) )
=> ( ( ( sK2 @ sK4 )
!= $true )
& ( $true
= ( sK1 @ sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
& ( $true
= ( sK2 @ X5 ) ) )
=> ( ( $true
!= ( sK0 @ sK5 ) )
& ( $true
= ( sK2 @ sK5 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X1 @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) )
| ? [X4: a] :
( ( $true
!= ( X2 @ X4 ) )
& ( $true
= ( X1 @ X4 ) ) )
| ? [X5: a] :
( ( $true
!= ( X0 @ X5 ) )
& ( $true
= ( X2 @ X5 ) ) ) )
& ( X0 = X2 )
& ( X0 = X1 ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X5: a] :
( ( ( X1 @ X5 )
!= $true )
& ( $true
= ( X0 @ X5 ) ) )
| ? [X3: a] :
( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true ) )
| ? [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
& ( $true
= ( X2 @ X4 ) ) ) )
& ( X0 = X2 )
& ( X0 = X1 ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ? [X5: a] :
( ( ( X1 @ X5 )
!= $true )
& ( $true
= ( X0 @ X5 ) ) )
| ? [X3: a] :
( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true ) )
| ? [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
& ( $true
= ( X2 @ X4 ) ) ) )
& ( X0 = X2 )
& ( X0 = X1 ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ( X0 = X2 )
& ( X0 = X1 ) )
=> ( ! [X4: a] :
( ( $true
= ( X2 @ X4 ) )
=> ( $true
= ( X0 @ X4 ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
=> ( ( X2 @ X3 )
= $true ) )
& ! [X5: a] :
( ( $true
= ( X0 @ X5 ) )
=> ( ( X1 @ X5 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( X0 = X2 )
& ( X0 = X1 ) )
=> ( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X0 @ X4 ) )
& ! [X5: a] :
( ( X0 @ X5 )
=> ( X1 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X0 @ X3 ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X0 @ X3 ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM9_pme) ).
thf(f14,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( ( sK2 @ sK4 )
!= $true )
| ( $true
!= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f51,plain,
( ~ spl6_2
| ~ spl6_3
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f25,f34,f42,f38]) ).
thf(f25,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( $true
!= ( sK1 @ sK5 ) )
| ( $true
!= ( sK1 @ sK4 ) ) ),
inference(definition_unfolding,[],[f23,f24,f14]) ).
thf(f23,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( ( sK2 @ sK4 )
!= $true )
| ( $true
!= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f50,plain,
( ~ spl6_1
| spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f30,f38,f42,f34]) ).
thf(f30,plain,
( ( $true
!= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(definition_unfolding,[],[f18,f14,f24,f24]) ).
thf(f18,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( ( sK2 @ sK4 )
!= $true )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f49,plain,
( ~ spl6_3
| ~ spl6_2
| spl6_1 ),
inference(avatar_split_clause,[],[f27,f34,f38,f42]) ).
thf(f27,plain,
( ( $true
!= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
!= ( sK1 @ sK3 ) ) ),
inference(definition_unfolding,[],[f21,f14]) ).
thf(f21,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
!= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f48,plain,
( spl6_3
| ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f26,f34,f38,f42]) ).
thf(f26,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
!= ( sK1 @ sK4 ) )
| ( $true
!= ( sK1 @ sK3 ) ) ),
inference(definition_unfolding,[],[f22,f24,f24]) ).
thf(f22,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( ( sK2 @ sK4 )
!= $true )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f47,plain,
( spl6_1
| spl6_3
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f28,f38,f42,f34]) ).
thf(f28,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(definition_unfolding,[],[f20,f24]) ).
thf(f20,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f46,plain,
( spl6_1
| spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f32,f42,f38,f34]) ).
thf(f32,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(definition_unfolding,[],[f16,f14,f24]) ).
thf(f16,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f45,plain,
( spl6_1
| spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f31,f42,f38,f34]) ).
thf(f31,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
!= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(definition_unfolding,[],[f17,f14,f14]) ).
thf(f17,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK4 ) )
| ( $true
!= ( sK0 @ sK5 ) ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SEU850^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.11 % 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.11/0.31 % Computer : n020.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 : Sun May 19 17:00:37 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TH0_THM_EQU_NAR problem
% 0.16/0.31 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.16/0.33 % (9005)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.33 % (9002)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.16/0.33 % (9004)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.16/0.33 % (9003)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.16/0.33 % (9006)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.16/0.33 % (9007)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.16/0.33 % (9008)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.33 % (9009)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.16/0.33 % (9005)Instruction limit reached!
% 0.16/0.33 % (9005)------------------------------
% 0.16/0.33 % (9005)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (9005)Termination reason: Unknown
% 0.16/0.33 % (9006)Instruction limit reached!
% 0.16/0.33 % (9006)------------------------------
% 0.16/0.33 % (9006)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (9006)Termination reason: Unknown
% 0.16/0.33 % (9006)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (9006)Memory used [KB]: 5500
% 0.16/0.33 % (9006)Time elapsed: 0.003 s
% 0.16/0.33 % (9006)Instructions burned: 2 (million)
% 0.16/0.33 % (9006)------------------------------
% 0.16/0.33 % (9006)------------------------------
% 0.16/0.33 % (9005)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (9005)Memory used [KB]: 5500
% 0.16/0.33 % (9005)Time elapsed: 0.003 s
% 0.16/0.33 % (9007)First to succeed.
% 0.16/0.33 % (9005)Instructions burned: 2 (million)
% 0.16/0.33 % (9005)------------------------------
% 0.16/0.33 % (9005)------------------------------
% 0.16/0.33 % (9009)Also succeeded, but the first one will report.
% 0.16/0.33 % (9008)Also succeeded, but the first one will report.
% 0.16/0.33 % (9007)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (9007)------------------------------
% 0.16/0.33 % (9007)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (9007)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (9007)Memory used [KB]: 5500
% 0.16/0.33 % (9007)Time elapsed: 0.004 s
% 0.16/0.33 % (9007)Instructions burned: 1 (million)
% 0.16/0.33 % (9007)------------------------------
% 0.16/0.33 % (9007)------------------------------
% 0.16/0.33 % (9001)Success in time 0.004 s
% 0.16/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------