TSTP Solution File: SET159^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET159^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 : n032.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:09:20 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 63 ( 16 unt; 7 typ; 0 def)
% Number of atoms : 299 ( 75 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 318 ( 34 ~; 122 |; 0 &; 155 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 20 ^ 12 !; 6 ?; 39 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a > $o ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK5: a ).
thf(f99,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f54,f64,f70,f75,f85,f98]) ).
thf(f98,plain,
( ~ spl3_1
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f97]) ).
thf(f97,plain,
( $false
| ~ spl3_1
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f92,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_5 ),
inference(superposition,[],[f44,f23]) ).
thf(f23,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f21,plain,
( spl3_1
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f44,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f42,plain,
( spl3_5
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f85,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f84]) ).
thf(f84,plain,
( $false
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( $true = $false )
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f40,f31]) ).
thf(f31,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl3_3
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f40,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f38,plain,
( spl3_4
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f75,plain,
( ~ spl3_2
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f74]) ).
thf(f74,plain,
( $false
| ~ spl3_2
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_6 ),
inference(backward_demodulation,[],[f27,f52]) ).
thf(f52,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl3_6
<=> ( $false
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f27,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl3_2
<=> ( $true
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f70,plain,
spl3_6,
inference(avatar_split_clause,[],[f69,f50]) ).
thf(f69,plain,
( $false
= ( sK0 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f68]) ).
thf(f68,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f55]) ).
thf(f55,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
!= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 )
| ( sK2 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 )
| ( X2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 )
| ( X2 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 )
| ( X2 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
| ( X0 @ X3 )
| ( X2 @ X3 ) ) )
= ( ^ [X4: a] :
( ( X2 @ X4 )
| ( X1 @ X4 )
| ( X0 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 )
| ( X2 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X2 @ X3 )
| ( X0 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 )
| ( X2 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X2 @ X3 )
| ( X0 @ X3 )
| ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_64_pme) ).
thf(f64,plain,
spl3_4,
inference(avatar_split_clause,[],[f59,f38]) ).
thf(f59,plain,
( $false
= ( sK2 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f57]) ).
thf(f57,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f56]) ).
thf(f56,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f54,plain,
spl3_5,
inference(avatar_split_clause,[],[f48,f42]) ).
thf(f48,plain,
( ( sK1 @ sK5 )
= $false ),
inference(duplicate_literal_removal,[],[f46]) ).
thf(f46,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f36]) ).
thf(f36,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f32,plain,
( spl3_1
| spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f19,f29,f25,f21]) ).
thf(f19,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f18]) ).
thf(f18,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f16]) ).
thf(f16,plain,
( ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET159^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.13 % 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.12/0.33 % Computer : n032.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 : Mon May 20 11:38:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_EQU_NAR problem
% 0.12/0.33 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.12/0.35 % (2510)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.12/0.35 % (2511)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.12/0.35 % (2509)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.12/0.35 % (2513)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.12/0.35 % (2512)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.35 % (2515)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.35 % (2514)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.12/0.35 % (2516)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.12/0.35 % (2513)Instruction limit reached!
% 0.12/0.35 % (2513)------------------------------
% 0.12/0.35 % (2513)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2513)Termination reason: Unknown
% 0.12/0.35 % (2513)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (2513)Memory used [KB]: 895
% 0.12/0.35 % (2513)Time elapsed: 0.002 s
% 0.12/0.35 % (2513)Instructions burned: 2 (million)
% 0.12/0.35 % (2513)------------------------------
% 0.12/0.35 % (2513)------------------------------
% 0.12/0.35 % (2512)Instruction limit reached!
% 0.12/0.35 % (2512)------------------------------
% 0.12/0.35 % (2512)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2516)Refutation not found, incomplete strategy
% 0.12/0.35 % (2516)------------------------------
% 0.12/0.35 % (2516)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (2516)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 % (2516)Memory used [KB]: 5500
% 0.12/0.35 % (2516)Time elapsed: 0.002 s
% 0.12/0.35 % (2516)Instructions burned: 2 (million)
% 0.12/0.35 % (2516)------------------------------
% 0.12/0.35 % (2516)------------------------------
% 0.12/0.35 % (2512)Termination reason: Unknown
% 0.12/0.35 % (2512)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (2512)Memory used [KB]: 5500
% 0.12/0.35 % (2512)Time elapsed: 0.003 s
% 0.12/0.35 % (2512)Instructions burned: 2 (million)
% 0.12/0.35 % (2512)------------------------------
% 0.12/0.35 % (2512)------------------------------
% 0.12/0.35 % (2510)First to succeed.
% 0.12/0.35 % (2509)Also succeeded, but the first one will report.
% 0.12/0.36 % (2510)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (2510)------------------------------
% 0.12/0.36 % (2510)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (2510)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (2510)Memory used [KB]: 5500
% 0.12/0.36 % (2510)Time elapsed: 0.005 s
% 0.12/0.36 % (2510)Instructions burned: 3 (million)
% 0.12/0.36 % (2510)------------------------------
% 0.12/0.36 % (2510)------------------------------
% 0.12/0.36 % (2508)Success in time 0.016 s
% 0.12/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------