TSTP Solution File: SET593^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET593^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:12:16 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 54 ( 1 unt; 8 typ; 0 def)
% Number of atoms : 352 ( 123 equ; 0 cnn)
% Maximal formula atoms : 18 ( 7 avg)
% Number of connectives : 376 ( 87 ~; 59 |; 53 &; 148 @)
% ( 6 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 62 ( 0 ^ 37 !; 24 ?; 62 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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 ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(func_def_9,type,
sK4: a ).
thf(f63,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f41,f46,f47,f52,f53,f54,f55,f56,f59,f62]) ).
thf(f62,plain,
( spl5_6
| spl5_4
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f61,f25,f38,f49]) ).
thf(f49,plain,
( spl5_6
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
thf(f38,plain,
( spl5_4
<=> ( ( sK2 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
thf(f25,plain,
( spl5_1
<=> ( ( sK1 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f61,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( ( sK2 @ sK4 )
= $true )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ( ( sK2 @ sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 ) )
| ( $true != $true )
| ~ spl5_1 ),
inference(superposition,[],[f14,f27]) ).
thf(f27,plain,
( ( ( sK1 @ sK4 )
= $true )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f14,plain,
! [X5: a] :
( ( ( sK1 @ X5 )
!= $true )
| ( $true
= ( sK0 @ X5 ) )
| ( ( sK2 @ X5 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( ( $true
= ( sK1 @ sK3 ) )
& ( ( sK2 @ sK3 )
!= $true )
& ( ( sK0 @ sK3 )
!= $true ) )
| ( ( $true
!= ( sK0 @ sK4 ) )
& ( ( sK2 @ sK4 )
!= $true )
& ( ( sK1 @ sK4 )
= $true ) ) )
& ! [X5: a] :
( ( ( sK2 @ X5 )
= $true )
| ( $true
= ( sK0 @ X5 ) )
| ( ( sK1 @ X5 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f9,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X2 @ X3 )
!= $true )
& ( ( X0 @ X3 )
!= $true ) )
| ? [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
!= $true )
& ( ( X1 @ X4 )
= $true ) ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( ( X0 @ X5 )
= $true )
| ( $true
!= ( X1 @ X5 ) ) ) )
=> ( ( ? [X3: a] :
( ( ( sK1 @ X3 )
= $true )
& ( ( sK2 @ X3 )
!= $true )
& ( ( sK0 @ X3 )
!= $true ) )
| ? [X4: a] :
( ( ( sK0 @ X4 )
!= $true )
& ( ( sK2 @ X4 )
!= $true )
& ( ( sK1 @ X4 )
= $true ) ) )
& ! [X5: a] :
( ( ( sK2 @ X5 )
= $true )
| ( $true
= ( sK0 @ X5 ) )
| ( ( sK1 @ X5 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X3: a] :
( ( ( sK1 @ X3 )
= $true )
& ( ( sK2 @ X3 )
!= $true )
& ( ( sK0 @ X3 )
!= $true ) )
=> ( ( $true
= ( sK1 @ sK3 ) )
& ( ( sK2 @ sK3 )
!= $true )
& ( ( sK0 @ sK3 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X4: a] :
( ( ( sK0 @ X4 )
!= $true )
& ( ( sK2 @ X4 )
!= $true )
& ( ( sK1 @ X4 )
= $true ) )
=> ( ( $true
!= ( sK0 @ sK4 ) )
& ( ( sK2 @ sK4 )
!= $true )
& ( ( sK1 @ sK4 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X1 @ X3 )
= $true )
& ( ( X2 @ X3 )
!= $true )
& ( ( X0 @ X3 )
!= $true ) )
| ? [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
!= $true )
& ( ( X1 @ X4 )
= $true ) ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( ( X0 @ X5 )
= $true )
| ( $true
!= ( X1 @ X5 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( ( X1 @ X4 )
!= $true )
& ( ( X2 @ X4 )
!= $true ) )
| ? [X5: a] :
( ( ( X2 @ X5 )
!= $true )
& ( $true
!= ( X1 @ X5 ) )
& ( ( X0 @ X5 )
= $true ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ? [X5: a] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) )
| ? [X4: a] :
( ( ( X1 @ X4 )
!= $true )
& ( $true
= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
!= $true ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true ) ) )
=> ( ! [X5: a] :
( ( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) )
=> ( ( X2 @ X5 )
= $true ) )
& ! [X4: a] :
( ( ( $true
= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
!= $true ) )
=> ( ( X1 @ X4 )
= $true ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true ) ) )
=> ( ! [X4: a] :
( ( ( ( X2 @ X4 )
!= $true )
& ( $true
= ( X0 @ X4 ) ) )
=> ( ( X1 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) )
=> ( ( X2 @ X5 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X2 @ X3 )
| ( X1 @ X3 ) ) )
=> ( ! [X4: a] :
( ( ~ ( X2 @ X4 )
& ( X0 @ X4 ) )
=> ( X1 @ X4 ) )
& ! [X5: a] :
( ( ( X0 @ X5 )
& ~ ( X1 @ X5 ) )
=> ( X2 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X1 @ X3 )
| ( X2 @ X3 ) ) )
=> ( ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X2 @ X3 ) )
=> ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X1 @ X3 )
| ( X2 @ X3 ) ) )
=> ( ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X2 @ X3 ) )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_52_pme) ).
thf(f59,plain,
( spl5_2
| spl5_5
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f58,f34,f43,f29]) ).
thf(f29,plain,
( spl5_2
<=> ( ( sK2 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f43,plain,
( spl5_5
<=> ( ( sK0 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
thf(f34,plain,
( spl5_3
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
thf(f58,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( ( sK2 @ sK3 )
= $true )
| ~ spl5_3 ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f57,plain,
( ( ( sK0 @ sK3 )
= $true )
| ( $true != $true )
| ( ( sK2 @ sK3 )
= $true )
| ~ spl5_3 ),
inference(superposition,[],[f14,f36]) ).
thf(f36,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f56,plain,
( spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f21,f34,f25]) ).
thf(f21,plain,
( ( ( sK1 @ sK4 )
= $true )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f55,plain,
( ~ spl5_6
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f20,f29,f49]) ).
thf(f20,plain,
( ( ( sK2 @ sK3 )
!= $true )
| ( $true
!= ( sK0 @ sK4 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f54,plain,
( ~ spl5_4
| ~ spl5_5 ),
inference(avatar_split_clause,[],[f16,f43,f38]) ).
thf(f16,plain,
( ( ( sK0 @ sK3 )
!= $true )
| ( ( sK2 @ sK4 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f53,plain,
( ~ spl5_6
| ~ spl5_5 ),
inference(avatar_split_clause,[],[f17,f43,f49]) ).
thf(f17,plain,
( ( $true
!= ( sK0 @ sK4 ) )
| ( ( sK0 @ sK3 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f52,plain,
( ~ spl5_6
| spl5_3 ),
inference(avatar_split_clause,[],[f23,f34,f49]) ).
thf(f23,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
!= ( sK0 @ sK4 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f47,plain,
( ~ spl5_2
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f19,f38,f29]) ).
thf(f19,plain,
( ( ( sK2 @ sK4 )
!= $true )
| ( ( sK2 @ sK3 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f46,plain,
( spl5_1
| ~ spl5_5 ),
inference(avatar_split_clause,[],[f15,f43,f25]) ).
thf(f15,plain,
( ( ( sK0 @ sK3 )
!= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f41,plain,
( spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f22,f38,f34]) ).
thf(f22,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( ( sK2 @ sK4 )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f32,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f18,f29,f25]) ).
thf(f18,plain,
( ( ( sK2 @ sK3 )
!= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SET593^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 12:08:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.36 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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 % (15958)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.13/0.37 % (15960)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.13/0.37 % (15961)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.13/0.37 % (15962)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (15963)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.13/0.37 % (15956)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.13/0.37 % (15960)Instruction limit reached!
% 0.13/0.37 % (15960)------------------------------
% 0.13/0.37 % (15960)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (15960)Termination reason: Unknown
% 0.13/0.37 % (15960)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (15960)Memory used [KB]: 5500
% 0.13/0.37 % (15960)Time elapsed: 0.003 s
% 0.13/0.37 % (15960)Instructions burned: 2 (million)
% 0.13/0.37 % (15960)------------------------------
% 0.13/0.37 % (15960)------------------------------
% 0.13/0.37 % (15957)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.13/0.37 % (15958)First to succeed.
% 0.13/0.38 % (15963)Instruction limit reached!
% 0.13/0.38 % (15963)------------------------------
% 0.13/0.38 % (15963)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (15963)Termination reason: Unknown
% 0.13/0.38 % (15963)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (15963)Memory used [KB]: 5500
% 0.13/0.38 % (15963)Time elapsed: 0.004 s
% 0.13/0.38 % (15963)Instructions burned: 4 (million)
% 0.13/0.38 % (15963)------------------------------
% 0.13/0.38 % (15963)------------------------------
% 0.13/0.38 % (15962)Also succeeded, but the first one will report.
% 0.13/0.38 % (15961)Also succeeded, but the first one will report.
% 0.13/0.38 % (15958)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (15958)------------------------------
% 0.13/0.38 % (15958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (15958)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (15958)Memory used [KB]: 5500
% 0.13/0.38 % (15958)Time elapsed: 0.005 s
% 0.13/0.38 % (15958)Instructions burned: 2 (million)
% 0.13/0.38 % (15958)------------------------------
% 0.13/0.38 % (15958)------------------------------
% 0.13/0.38 % (15955)Success in time 0.016 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------