TSTP Solution File: SYO148^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO148^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 : n006.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 09:03:09 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 354 ( 100 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 276 ( 61 ~; 70 |; 3 &; 120 @)
% ( 17 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 23 ( 9 ^ 13 !; 0 ?; 23 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cZ: a > $o ).
thf(func_def_2,type,
cY: a > $o ).
thf(func_def_3,type,
cX: a > $o ).
thf(func_def_12,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK2: a ).
thf(f96,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f47,f52,f53,f59,f73,f82,f95]) ).
thf(f95,plain,
( spl0_1
| spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f94]) ).
thf(f94,plain,
( $false
| spl0_1
| spl0_3
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f93,f31]) ).
thf(f31,plain,
( ( $true
!= ( cY @ sK2 ) )
| spl0_1 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl0_1
<=> ( $true
= ( cY @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f93,plain,
( ( $true
= ( cY @ sK2 ) )
| spl0_3
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f63,f41]) ).
thf(f41,plain,
( ( ( cZ @ sK2 )
!= $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl0_3
<=> ( ( cZ @ sK2 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f63,plain,
( ( ( cZ @ sK2 )
= $false )
| ( $true
= ( cY @ sK2 ) )
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
( ( $true
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $false )
| ( $true = $false )
| ~ spl0_5 ),
inference(superposition,[],[f12,f51]) ).
thf(f51,plain,
( ( ( cX @ sK2 )
= $false )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f49,plain,
( spl0_5
<=> ( ( cX @ sK2 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f12,plain,
! [X0: a] :
( ( ( cX @ X0 )
= $true )
| ( ( cZ @ X0 )
= $false )
| ( ( cY @ X0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f9,plain,
! [X0: a] :
( ( ( cX @ X0 )
= $true )
| ( ( cY @ X0 )
= ( cZ @ X0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( cX
!= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) ) ) )
& ! [X0: a] :
( ( ( ( cX @ X0 )
!= $true )
| ( ( cY @ X0 )
!= ( cZ @ X0 ) ) )
& ( ( ( cY @ X0 )
= ( cZ @ X0 ) )
| ( ( cX @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( cX
!= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) ) ) )
& ! [X0: a] :
( ( ( cX @ X0 )
!= $true )
<=> ( ( cY @ X0 )
= ( cZ @ X0 ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: a] :
( ( ( cX @ X0 )
!= $true )
<=> ( ( cY @ X0 )
= ( cZ @ X0 ) ) )
=> ( cX
= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a] :
( ( ( cY @ X0 )
= ( cZ @ X0 ) )
<=> ( ( cX @ X0 )
!= $true ) )
=> ( cX
= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a] :
( ( ( cY @ X0 )
<=> ( cZ @ X0 ) )
<=> ~ ( cX @ X0 ) )
=> ( cX
= ( ^ [X1: a] :
~ ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a] :
( ( ( cY @ X0 )
<=> ( cZ @ X0 ) )
<=> ~ ( cX @ X0 ) )
=> ( cX
= ( ^ [X0: a] :
~ ( ( cY @ X0 )
<=> ( cZ @ X0 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a] :
( ( ( cY @ X0 )
<=> ( cZ @ X0 ) )
<=> ~ ( cX @ X0 ) )
=> ( cX
= ( ^ [X0: a] :
~ ( ( cY @ X0 )
<=> ( cZ @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL25) ).
thf(f82,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f81]) ).
thf(f81,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f32,f46]) ).
thf(f46,plain,
( ( $false
= ( cY @ sK2 ) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f44]) ).
thf(f44,plain,
( spl0_4
<=> ( $false
= ( cY @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f32,plain,
( ( $true
= ( cY @ sK2 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f73,plain,
( spl0_2
| spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f67,f49,f44,f34]) ).
thf(f34,plain,
( spl0_2
<=> ( ( cZ @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f67,plain,
( ( $false
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $true )
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( ( cZ @ sK2 )
= $true )
| ( $false
= ( cY @ sK2 ) )
| ( $true = $false )
| ~ spl0_5 ),
inference(superposition,[],[f13,f51]) ).
thf(f13,plain,
! [X0: a] :
( ( ( cX @ X0 )
= $true )
| ( ( cY @ X0 )
= $false )
| ( ( cZ @ X0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f59,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f58]) ).
thf(f58,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_3 ),
inference(superposition,[],[f36,f42]) ).
thf(f42,plain,
( ( ( cZ @ sK2 )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f36,plain,
( ( ( cZ @ sK2 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f53,plain,
( spl0_3
| spl0_5
| spl0_1 ),
inference(avatar_split_clause,[],[f23,f30,f49,f40]) ).
thf(f23,plain,
( ( ( cX @ sK2 )
= $false )
| ( $true
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( ( cZ @ sK2 )
= ( cY @ sK2 ) )
| ( ( cX @ sK2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( ( ( cY @ sK2 )
= ( cZ @ sK2 ) )
= $true )
| ( ( cX @ sK2 )
= $false ) ),
inference(not_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( ( cX @ sK2 )
= $false )
| ( $false
= ( ( cY @ sK2 )
!= ( cZ @ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( cX @ sK2 )
!= ( ( cY @ sK2 )
!= ( cZ @ sK2 ) ) ),
inference(beta_eta_normalization,[],[f16]) ).
thf(f16,plain,
( ( cX @ sK2 )
!= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f11]) ).
thf(f11,plain,
( cX
!= ( ^ [Y0: a] :
( ( cY @ Y0 )
!= ( cZ @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f52,plain,
( spl0_4
| spl0_5
| spl0_2 ),
inference(avatar_split_clause,[],[f22,f34,f49,f44]) ).
thf(f22,plain,
( ( ( cX @ sK2 )
= $false )
| ( $false
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f21]) ).
thf(f47,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f38,f44,f40]) ).
thf(f38,plain,
( ( ( cZ @ sK2 )
= $false )
| ( $false
= ( cY @ sK2 ) ) ),
inference(subsumption_resolution,[],[f27,f15]) ).
thf(f15,plain,
! [X0: a] :
( ( ( cY @ X0 )
= $false )
| ( ( cZ @ X0 )
= $false )
| ( ( cX @ X0 )
!= $true ) ),
inference(binary_proxy_clausification,[],[f10]) ).
thf(f10,plain,
! [X0: a] :
( ( ( cY @ X0 )
!= ( cZ @ X0 ) )
| ( ( cX @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f27,plain,
( ( ( cX @ sK2 )
= $true )
| ( $false
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( ( cX @ sK2 )
= $true )
| ( ( cZ @ sK2 )
!= ( cY @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f24]) ).
thf(f24,plain,
( ( ( cX @ sK2 )
= $true )
| ( ( ( cY @ sK2 )
= ( cZ @ sK2 ) )
= $false ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( ( cX @ sK2 )
= $true )
| ( $true
= ( ( cY @ sK2 )
!= ( cZ @ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f37,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f28,f34,f30]) ).
thf(f28,plain,
( ( $true
= ( cY @ sK2 ) )
| ( ( cZ @ sK2 )
= $true ) ),
inference(subsumption_resolution,[],[f26,f14]) ).
thf(f14,plain,
! [X0: a] :
( ( ( cY @ X0 )
= $true )
| ( ( cX @ X0 )
!= $true )
| ( ( cZ @ X0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f10]) ).
thf(f26,plain,
( ( ( cZ @ sK2 )
= $true )
| ( ( cX @ sK2 )
= $true )
| ( $true
= ( cY @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO148^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14 % 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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:10:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 % (32216)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (32214)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.14/0.38 % (32213)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.14/0.38 % (32217)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.14/0.38 % (32215)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.14/0.38 % (32219)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (32216)Instruction limit reached!
% 0.14/0.38 % (32216)------------------------------
% 0.14/0.38 % (32216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32217)Instruction limit reached!
% 0.14/0.38 % (32217)------------------------------
% 0.14/0.38 % (32217)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32216)Termination reason: Unknown
% 0.14/0.38 % (32216)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (32216)Memory used [KB]: 5500
% 0.14/0.38 % (32216)Time elapsed: 0.004 s
% 0.14/0.38 % (32216)Instructions burned: 2 (million)
% 0.14/0.38 % (32216)------------------------------
% 0.14/0.38 % (32216)------------------------------
% 0.14/0.38 % (32217)Termination reason: Unknown
% 0.14/0.38 % (32217)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (32217)Memory used [KB]: 5500
% 0.14/0.38 % (32217)Time elapsed: 0.004 s
% 0.14/0.38 % (32217)Instructions burned: 2 (million)
% 0.14/0.38 % (32217)------------------------------
% 0.14/0.38 % (32217)------------------------------
% 0.14/0.38 % (32214)Instruction limit reached!
% 0.14/0.38 % (32214)------------------------------
% 0.14/0.38 % (32214)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32214)Termination reason: Unknown
% 0.14/0.38 % (32214)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (32214)Memory used [KB]: 5500
% 0.14/0.38 % (32214)Time elapsed: 0.006 s
% 0.14/0.38 % (32214)Instructions burned: 5 (million)
% 0.14/0.38 % (32214)------------------------------
% 0.14/0.38 % (32214)------------------------------
% 0.14/0.38 % (32213)First to succeed.
% 0.14/0.38 % (32218)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.14/0.38 % (32219)Also succeeded, but the first one will report.
% 0.14/0.38 % (32213)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (32213)------------------------------
% 0.14/0.38 % (32213)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32213)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (32213)Memory used [KB]: 5500
% 0.14/0.38 % (32213)Time elapsed: 0.007 s
% 0.14/0.38 % (32213)Instructions burned: 4 (million)
% 0.14/0.38 % (32213)------------------------------
% 0.14/0.38 % (32213)------------------------------
% 0.14/0.38 % (32212)Success in time 0.008 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------