TSTP Solution File: SYO241^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO241^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 : n017.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:37 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 161 ( 94 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 340 ( 60 ~; 27 |; 33 &; 195 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 96 ( 96 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 3 con; 0-2 aty)
% ( 0 !!; 13 ??; 0 @@+; 0 @@-)
% Number of variables : 92 ( 28 ^ 49 !; 14 ?; 92 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_10,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_11,type,
sK1: $i > $o ).
thf(func_def_13,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK4: $i > $i > $o ).
thf(func_def_15,type,
sK5: $i > $i > $o ).
thf(func_def_16,type,
sK6: $i > $o ).
thf(f67,plain,
$false,
inference(subsumption_resolution,[],[f63,f11]) ).
thf(f11,plain,
( $true
!= ( sK1 @ ( sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( sK0 @ X1 )
!= ( sK0 @ X2 ) ) )
& ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ( $true
!= ( sK1 @ ( sK0 @ sK1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( X0 @ X1 )
!= ( X0 @ X2 ) ) )
& ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
& ( ( X3 @ ( X0 @ X3 ) )
!= $true ) ) )
=> ( ! [X2: $i > $o,X1: $i > $o] :
( ( X1 = X2 )
| ( ( sK0 @ X1 )
!= ( sK0 @ X2 ) ) )
& ? [X3: $i > $o] :
( ( ( sK0 @ X3 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ( $true
!= ( X3 @ ( sK0 @ X3 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X3: $i > $o] :
( ( ( sK0 @ X3 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ( $true
!= ( X3 @ ( sK0 @ X3 ) ) ) )
=> ( ( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ( $true
!= ( sK1 @ ( sK0 @ sK1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( X1 = X2 )
| ( ( X0 @ X1 )
!= ( X0 @ X2 ) ) )
& ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
& ( ( X3 @ ( X0 @ X3 ) )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
& ( ( X3 @ ( X0 @ X3 ) )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
& ( ( X3 @ ( X0 @ X3 ) )
!= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [X4: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X0 @ X5 ) )
& ( ( X0 @ X5 )
= X4 ) ) ) )
& ~ ( X3 @ ( X0 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [X4: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X0 @ X5 ) )
& ( ( X0 @ X5 )
= X4 ) ) ) )
& ~ ( X3 @ ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( $i > $o ) > $i] :
( ! [X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X1 )
= ( X0 @ X2 ) )
=> ( X1 = X2 ) )
=> ~ ? [X3: $i > $o] :
( ( ( X0 @ X3 )
= ( X0
@ ^ [X4: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X0 @ X5 ) )
& ( ( X0 @ X5 )
= X4 ) ) ) )
& ~ ( X3 @ ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM143_EXPAND) ).
thf(f63,plain,
( $true
= ( sK1 @ ( sK0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
( ( ( sK0 @ sK1 )
!= ( sK0 @ sK1 ) )
| ( $true != $true )
| ( $true
= ( sK1 @ ( sK0 @ sK1 ) ) ) ),
inference(equality_factoring,[],[f38]) ).
thf(f38,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
= ( X1 @ ( sK0 @ X1 ) ) )
| ( $true
= ( sK1 @ X0 ) )
| ( ( sK0 @ X1 )
!= X0 ) ),
inference(equality_resolution,[],[f33]) ).
thf(f33,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ X1 )
= $true )
| ( $true
= ( X2 @ ( sK0 @ X2 ) ) )
| ( ( sK0 @ X2 )
!= X1 ) ),
inference(not_proxy_clausification,[],[f32]) ).
thf(f32,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( sK0 @ X2 )
!= X1 )
| ( ( X0 @ X1 )
= $true ) ),
inference(equality_proxy_clausification,[],[f31]) ).
thf(f31,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( ( ( sK0 @ X2 )
= X1 )
= $false )
| ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
= $false )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( $false
= ( ( ( sK0 @ X2 )
= X1 )
& ~ ( X2 @ ( sK0 @ X2 ) ) ) )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ X1 )
= $true ) ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ X1 )
= $true )
| ( ( ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= X1 )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) )
@ X2 )
= $false ) ),
inference(pi_clausification,[],[f21]) ).
thf(f21,plain,
! [X0: $i > $o,X1: $i] :
( ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ X1 )
= $true )
| ( ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= X1 )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ X1 )
= ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= X1 )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) ) )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) ) ),
inference(beta_eta_normalization,[],[f17]) ).
thf(f17,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ X1 )
= ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) )
@ X1 ) )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) ) ),
inference(argument_congruence,[],[f16]) ).
thf(f16,plain,
! [X0: $i > $o] :
( ( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
= X0 )
| ( ( sK0 @ sK1 )
!= ( sK0 @ X0 ) ) ),
inference(superposition,[],[f13,f12]) ).
thf(f12,plain,
( ( sK0 @ sK1 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
! [X2: $i > $o,X1: $i > $o] :
( ( ( sK0 @ X1 )
!= ( sK0 @ X2 ) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO241^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.12 % 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.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 10:32:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH0_THM_EQU_NAR problem
% 0.11/0.32 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.34 % (5670)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.34 % (5669)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.34 % (5673)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.34 % (5671)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.34 % (5674)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.34 % (5672)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.34 % (5673)Instruction limit reached!
% 0.11/0.34 % (5673)------------------------------
% 0.11/0.34 % (5673)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (5673)Termination reason: Unknown
% 0.11/0.34 % (5673)Termination phase: Property scanning
% 0.11/0.34
% 0.11/0.34 % (5673)Memory used [KB]: 895
% 0.11/0.34 % (5673)Time elapsed: 0.002 s
% 0.11/0.34 % (5673)Instructions burned: 2 (million)
% 0.11/0.34 % (5673)------------------------------
% 0.11/0.34 % (5673)------------------------------
% 0.11/0.34 % (5676)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.11/0.34 % (5672)Instruction limit reached!
% 0.11/0.34 % (5672)------------------------------
% 0.11/0.34 % (5672)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (5672)Termination reason: Unknown
% 0.11/0.34 % (5672)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (5672)Memory used [KB]: 5500
% 0.11/0.34 % (5672)Time elapsed: 0.003 s
% 0.11/0.34 % (5672)Instructions burned: 2 (million)
% 0.11/0.34 % (5672)------------------------------
% 0.11/0.34 % (5672)------------------------------
% 0.11/0.34 % (5670)Instruction limit reached!
% 0.11/0.34 % (5670)------------------------------
% 0.11/0.34 % (5670)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (5675)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.34 % (5670)Termination reason: Unknown
% 0.11/0.34 % (5670)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (5670)Memory used [KB]: 5500
% 0.11/0.34 % (5670)Time elapsed: 0.004 s
% 0.11/0.34 % (5670)Instructions burned: 4 (million)
% 0.11/0.34 % (5670)------------------------------
% 0.11/0.34 % (5670)------------------------------
% 0.11/0.34 % (5676)Instruction limit reached!
% 0.11/0.34 % (5676)------------------------------
% 0.11/0.34 % (5676)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (5676)Termination reason: Unknown
% 0.11/0.34 % (5676)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (5676)Memory used [KB]: 5500
% 0.11/0.34 % (5676)Time elapsed: 0.004 s
% 0.11/0.34 % (5676)Instructions burned: 4 (million)
% 0.11/0.34 % (5676)------------------------------
% 0.11/0.34 % (5676)------------------------------
% 0.11/0.34 % (5674)First to succeed.
% 0.11/0.35 % (5671)Also succeeded, but the first one will report.
% 0.11/0.35 % (5675)Also succeeded, but the first one will report.
% 0.11/0.35 % (5674)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.35 % (5674)------------------------------
% 0.11/0.35 % (5674)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (5674)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (5674)Memory used [KB]: 5500
% 0.11/0.35 % (5674)Time elapsed: 0.007 s
% 0.11/0.35 % (5674)Instructions burned: 6 (million)
% 0.11/0.35 % (5674)------------------------------
% 0.11/0.35 % (5674)------------------------------
% 0.11/0.35 % (5668)Success in time 0.013 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------