TSTP Solution File: SYO356^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO356^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 : n011.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:04:07 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 80 ( 41 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 107 ( 16 ~; 6 |; 6 &; 65 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 12 ^ 16 !; 4 ?; 33 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
v: a ).
thf(func_def_2,type,
u: a ).
thf(func_def_6,type,
sK0: ( a > a > $o ) > a ).
thf(func_def_7,type,
sK1: a > $o ).
thf(func_def_10,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f38,plain,
$false,
inference(subsumption_resolution,[],[f37,f10]) ).
thf(f10,plain,
( $true
!= ( sK1 @ v ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ! [X0: a > a > $o] :
( ( ( X0 @ u @ v )
= $true )
| ( ( X0 @ ( sK0 @ X0 ) @ ( sK0 @ X0 ) )
!= $true ) )
& ( ( sK1 @ u )
= $true )
& ( $true
!= ( sK1 @ v ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
thf(f7,plain,
! [X0: a > a > $o] :
( ? [X1: a] :
( ( X0 @ X1 @ X1 )
!= $true )
=> ( ( X0 @ ( sK0 @ X0 ) @ ( sK0 @ X0 ) )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X2: a > $o] :
( ( ( X2 @ u )
= $true )
& ( ( X2 @ v )
!= $true ) )
=> ( ( ( sK1 @ u )
= $true )
& ( $true
!= ( sK1 @ v ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
( ! [X0: a > a > $o] :
( ( ( X0 @ u @ v )
= $true )
| ? [X1: a] :
( ( X0 @ X1 @ X1 )
!= $true ) )
& ? [X2: a > $o] :
( ( ( X2 @ u )
= $true )
& ( ( X2 @ v )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] :
( ( X0 @ X1 @ X1 )
= $true )
=> ( ( X0 @ u @ v )
= $true ) )
=> ! [X2: a > $o] :
( ( ( X2 @ u )
= $true )
=> ( ( X2 @ v )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] : ( X0 @ X1 @ X1 )
=> ( X0 @ u @ v ) )
=> ! [X2: a > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] : ( X0 @ X1 @ X1 )
=> ( X0 @ u @ v ) )
=> ! [X2: a > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a > a > $o] :
( ! [X1: a] : ( X0 @ X1 @ X1 )
=> ( X0 @ u @ v ) )
=> ! [X2: a > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE1LEIBEQ2_pme) ).
thf(f37,plain,
( $true
= ( sK1 @ v ) ),
inference(superposition,[],[f11,f26]) ).
thf(f26,plain,
u = v,
inference(equality_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( v = u )
= $true ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( ( v = u )
= $true )
| ( $true != $true ) ),
inference(boolean_simplification,[],[f23]) ).
thf(f23,plain,
( ( $true
!= ( ( sK0
@ ^ [Y0: a,Y1: a] : ( Y1 = Y0 ) )
= ( sK0
@ ^ [Y0: a,Y1: a] : ( Y1 = Y0 ) ) ) )
| ( ( v = u )
= $true ) ),
inference(beta_eta_normalization,[],[f13]) ).
thf(f13,plain,
( ( $true
= ( ^ [Y0: a,Y1: a] : ( Y1 = Y0 )
@ u
@ v ) )
| ( ( ^ [Y0: a,Y1: a] : ( Y1 = Y0 )
@ ( sK0
@ ^ [Y0: a,Y1: a] : ( Y1 = Y0 ) )
@ ( sK0
@ ^ [Y0: a,Y1: a] : ( Y1 = Y0 ) ) )
!= $true ) ),
inference(primitive_instantiation,[],[f12]) ).
thf(f12,plain,
! [X0: a > a > $o] :
( ( ( X0 @ ( sK0 @ X0 ) @ ( sK0 @ X0 ) )
!= $true )
| ( ( X0 @ u @ v )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
( ( sK1 @ u )
= $true ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO356^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 08:49:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 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.14/0.36 % (13166)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.36 % (13166)Refutation not found, incomplete strategy
% 0.14/0.36 % (13166)------------------------------
% 0.14/0.36 % (13166)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (13166)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % (13166)Memory used [KB]: 5500
% 0.14/0.36 % (13166)Time elapsed: 0.002 s
% 0.14/0.36 % (13166)Instructions burned: 1 (million)
% 0.14/0.36 % (13166)------------------------------
% 0.14/0.36 % (13166)------------------------------
% 0.14/0.36 % (13165)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.36 % (13167)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.36 % (13164)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.37 % (13169)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.37 % (13170)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.37 % (13167)Instruction limit reached!
% 0.14/0.37 % (13167)------------------------------
% 0.14/0.37 % (13167)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (13167)Termination reason: Unknown
% 0.14/0.37 % (13167)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (13167)Memory used [KB]: 5500
% 0.14/0.37 % (13167)Time elapsed: 0.004 s
% 0.14/0.37 % (13167)Instructions burned: 2 (million)
% 0.14/0.37 % (13167)------------------------------
% 0.14/0.37 % (13167)------------------------------
% 0.14/0.37 % (13171)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.37 % (13164)First to succeed.
% 0.14/0.37 % (13169)Instruction limit reached!
% 0.14/0.37 % (13169)------------------------------
% 0.14/0.37 % (13169)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (13169)Termination reason: Unknown
% 0.14/0.37 % (13169)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (13169)Memory used [KB]: 5500
% 0.14/0.37 % (13169)Time elapsed: 0.004 s
% 0.14/0.37 % (13169)Instructions burned: 2 (million)
% 0.14/0.37 % (13169)------------------------------
% 0.14/0.37 % (13169)------------------------------
% 0.20/0.37 % (13172)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.20/0.37 % (13165)Instruction limit reached!
% 0.20/0.37 % (13165)------------------------------
% 0.20/0.37 % (13165)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13165)Termination reason: Unknown
% 0.20/0.37 % (13165)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (13165)Memory used [KB]: 5500
% 0.20/0.37 % (13165)Time elapsed: 0.007 s
% 0.20/0.37 % (13165)Instructions burned: 4 (million)
% 0.20/0.37 % (13165)------------------------------
% 0.20/0.37 % (13165)------------------------------
% 0.20/0.37 % (13177)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.37 % (13164)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (13164)------------------------------
% 0.20/0.37 % (13164)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13164)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (13164)Memory used [KB]: 5500
% 0.20/0.37 % (13164)Time elapsed: 0.006 s
% 0.20/0.37 % (13164)Instructions burned: 3 (million)
% 0.20/0.37 % (13164)------------------------------
% 0.20/0.37 % (13164)------------------------------
% 0.20/0.37 % (13162)Success in time 0.017 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------