TSTP Solution File: SET616^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET616^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 : n027.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:27 EDT 2024
% Result : Theorem 0.11s 0.28s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 242 ( 70 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 253 ( 65 ~; 46 |; 33 &; 100 @)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 46 ( 20 ^ 21 !; 4 ?; 46 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_11,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK4: a ).
thf(f77,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f31,f57,f67,f73,f76]) ).
thf(f76,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f75]) ).
thf(f75,plain,
( $false
| spl2_3
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f62,f25]) ).
thf(f25,plain,
( ( $false
!= ( sK0 @ sK4 ) )
| spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl2_3
<=> ( $false
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f62,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $true = $false )
| ~ spl2_4 ),
inference(superposition,[],[f44,f30]) ).
thf(f30,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f28,plain,
( spl2_4
<=> ( $false
= ( sK1 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f44,plain,
! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f43]) ).
thf(f43,plain,
! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( $true
= ( sK1 @ X1 ) )
| ( $true
= ( sK1 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f42]) ).
thf(f42,plain,
! [X1: a] :
( ( $false
= ( ~ ( sK1 @ X1 ) ) )
| ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f36]) ).
thf(f36,plain,
! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( $false
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f35]) ).
thf(f35,plain,
! [X1: a] :
( ( $true
= ( ~ ( sK0 @ X1 )
& ( sK1 @ X1 ) ) )
| ( $false
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
! [X1: a] :
( ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) )
= ( ~ ( sK0 @ X1 )
& ( sK1 @ X1 ) ) ),
inference(beta_eta_normalization,[],[f32]) ).
thf(f32,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( sK0 != sK1 )
& ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( X0 != X1 )
& ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) ) )
=> ( ( sK0 != sK1 )
& ( ( ^ [Y0: a] :
( ~ ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( X0 != X1 )
& ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ~ ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
=> ( X0 = X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ~ ( X0 @ X2 ) ) )
= ( ^ [X3: a] :
( ~ ( X1 @ X3 )
& ( X0 @ X3 ) ) ) )
=> ( X0 = X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) )
= ( ^ [X2: a] :
( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) ) )
=> ( X0 = X1 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) )
= ( ^ [X2: a] :
( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_90_pme) ).
thf(f73,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f72]) ).
thf(f72,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f69]) ).
thf(f69,plain,
( ( $true = $false )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f26,f17]) ).
thf(f17,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f15,plain,
( spl2_1
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f26,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f67,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f66]) ).
thf(f66,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_4 ),
inference(superposition,[],[f21,f30]) ).
thf(f21,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl2_2
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f57,plain,
( spl2_4
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f54,f24,f28]) ).
thf(f54,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
( ( $false
= ( sK1 @ sK4 ) )
| ( $true = $false )
| ~ spl2_3 ),
inference(superposition,[],[f51,f26]) ).
thf(f51,plain,
! [X1: a] :
( ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f50]) ).
thf(f50,plain,
! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f47]) ).
thf(f47,plain,
! [X1: a] :
( ( $true
= ( ~ ( sK1 @ X1 ) ) )
| ( $true
= ( sK0 @ X1 ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
! [X1: a] :
( ( $true
= ( sK0 @ X1 ) )
| ( $true
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f45,plain,
! [X1: a] :
( ( $false
= ( ~ ( sK0 @ X1 ) ) )
| ( $true
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f34,plain,
! [X1: a] :
( ( $false
= ( ~ ( sK0 @ X1 )
& ( sK1 @ X1 ) ) )
| ( $true
= ( ( sK0 @ X1 )
& ~ ( sK1 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f31,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f13,f28,f24]) ).
thf(f13,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( sK1 @ sK4 )
!= ( sK0 @ sK4 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f10,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f8]) ).
thf(f22,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f12,f19,f15]) ).
thf(f12,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET616^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.08 % 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.07/0.26 % Computer : n027.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon May 20 11:27:22 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.07/0.26 This is a TH0_THM_EQU_NAR problem
% 0.07/0.26 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.11/0.27 % (4033)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.11/0.27 % (4035)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.11/0.27 % (4034)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.11/0.27 % (4037)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.11/0.27 % (4036)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.27 % (4038)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.11/0.27 % (4039)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.11/0.27 % (4036)Instruction limit reached!
% 0.11/0.27 % (4036)------------------------------
% 0.11/0.27 % (4036)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.27 % (4037)Instruction limit reached!
% 0.11/0.27 % (4037)------------------------------
% 0.11/0.27 % (4037)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.27 % (4036)Termination reason: Unknown
% 0.11/0.27 % (4036)Termination phase: Saturation
% 0.11/0.27
% 0.11/0.27 % (4036)Memory used [KB]: 5500
% 0.11/0.27 % (4036)Time elapsed: 0.002 s
% 0.11/0.27 % (4036)Instructions burned: 2 (million)
% 0.11/0.27 % (4036)------------------------------
% 0.11/0.27 % (4036)------------------------------
% 0.11/0.27 % (4037)Termination reason: Unknown
% 0.11/0.27 % (4037)Termination phase: Saturation
% 0.11/0.27
% 0.11/0.27 % (4037)Memory used [KB]: 5500
% 0.11/0.27 % (4037)Time elapsed: 0.002 s
% 0.11/0.27 % (4037)Instructions burned: 2 (million)
% 0.11/0.27 % (4037)------------------------------
% 0.11/0.27 % (4037)------------------------------
% 0.11/0.27 % (4034)Instruction limit reached!
% 0.11/0.27 % (4034)------------------------------
% 0.11/0.27 % (4034)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.27 % (4034)Termination reason: Unknown
% 0.11/0.27 % (4034)Termination phase: Saturation
% 0.11/0.27
% 0.11/0.27 % (4034)Memory used [KB]: 5500
% 0.11/0.27 % (4034)Time elapsed: 0.003 s
% 0.11/0.27 % (4034)Instructions burned: 4 (million)
% 0.11/0.27 % (4034)------------------------------
% 0.11/0.27 % (4034)------------------------------
% 0.11/0.27 % (4033)First to succeed.
% 0.11/0.28 % (4038)Also succeeded, but the first one will report.
% 0.11/0.28 % (4033)Refutation found. Thanks to Tanya!
% 0.11/0.28 % SZS status Theorem for theBenchmark
% 0.11/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.28 % (4033)------------------------------
% 0.11/0.28 % (4033)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.28 % (4033)Termination reason: Refutation
% 0.11/0.28
% 0.11/0.28 % (4033)Memory used [KB]: 5500
% 0.11/0.28 % (4033)Time elapsed: 0.004 s
% 0.11/0.28 % (4033)Instructions burned: 3 (million)
% 0.11/0.28 % (4033)------------------------------
% 0.11/0.28 % (4033)------------------------------
% 0.11/0.28 % (4032)Success in time 0.008 s
% 0.11/0.28 % Vampire---4.8 exiting
%------------------------------------------------------------------------------