TSTP Solution File: SEV197^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV197^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 : n020.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 04:12:20 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 47 ( 3 unt; 13 typ; 0 def)
% Number of atoms : 181 ( 126 equ; 0 cnn)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 413 ( 62 ~; 42 |; 62 &; 220 @)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 13 con; 0-2 aty)
% Number of variables : 144 ( 0 ^ 111 !; 32 ?; 144 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
iS: $tType ).
thf(func_def_0,type,
iS: $tType ).
thf(func_def_1,type,
c0: iS ).
thf(func_def_2,type,
cP: iS > iS > iS ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: iS ).
thf(func_def_8,type,
sK1: iS ).
thf(func_def_9,type,
sK2: iS ).
thf(func_def_10,type,
sK3: iS ).
thf(func_def_11,type,
sK4: iS ).
thf(func_def_12,type,
sK5: iS ).
thf(func_def_13,type,
sK6: ( iS > $o ) > iS ).
thf(func_def_14,type,
sK7: ( iS > $o ) > iS ).
thf(f63,plain,
$false,
inference(avatar_sat_refutation,[],[f29,f38,f41,f51,f62]) ).
thf(f62,plain,
( spl8_3
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f61,f22,f31]) ).
thf(f31,plain,
( spl8_3
<=> ( sK0 = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f22,plain,
( spl8_1
<=> ( ( cP @ sK2 @ sK3 )
= ( cP @ sK0 @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f61,plain,
( ( sK0 = sK2 )
| ~ spl8_1 ),
inference(equality_resolution,[],[f46]) ).
thf(f46,plain,
( ! [X0: iS,X1: iS] :
( ( ( cP @ X0 @ X1 )
!= ( cP @ sK0 @ sK1 ) )
| ( sK2 = X0 ) )
| ~ spl8_1 ),
inference(superposition,[],[f20,f24]) ).
thf(f24,plain,
( ( ( cP @ sK2 @ sK3 )
= ( cP @ sK0 @ sK1 ) )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f20,plain,
! [X2: iS,X3: iS,X0: iS,X1: iS] :
( ( ( cP @ X3 @ X2 )
!= ( cP @ X1 @ X0 ) )
| ( X1 = X3 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X0: iS,X1: iS,X2: iS,X3: iS] :
( ( ( cP @ X3 @ X2 )
!= ( cP @ X1 @ X0 ) )
| ( ( X1 = X3 )
& ( X0 = X2 ) ) )
& ( ( ( ( sK0 != sK2 )
| ( sK3 != sK1 ) )
& ( ( cP @ sK2 @ sK3 )
= ( cP @ sK0 @ sK1 ) ) )
| ( c0
= ( cP @ sK5 @ sK4 ) ) )
& ! [X10: iS,X11: iS] :
( c0
!= ( cP @ X11 @ X10 ) )
& ! [X12: iS > $o] :
( ( ( ( X12 @ ( sK6 @ X12 ) )
= $true )
& ( ( X12 @ ( sK7 @ X12 ) )
= $true )
& ( ( X12 @ ( cP @ ( sK6 @ X12 ) @ ( sK7 @ X12 ) ) )
!= $true ) )
| ( ( X12 @ c0 )
!= $true )
| ! [X15: iS] :
( ( X12 @ X15 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f8,f11,f10,f9]) ).
thf(f9,plain,
( ? [X4: iS,X5: iS,X6: iS,X7: iS] :
( ( ( X4 != X6 )
| ( X5 != X7 ) )
& ( ( cP @ X6 @ X7 )
= ( cP @ X4 @ X5 ) ) )
=> ( ( ( sK0 != sK2 )
| ( sK3 != sK1 ) )
& ( ( cP @ sK2 @ sK3 )
= ( cP @ sK0 @ sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X8: iS,X9: iS] :
( c0
= ( cP @ X9 @ X8 ) )
=> ( c0
= ( cP @ sK5 @ sK4 ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X12: iS > $o] :
( ? [X13: iS,X14: iS] :
( ( ( X12 @ X13 )
= $true )
& ( ( X12 @ X14 )
= $true )
& ( ( X12 @ ( cP @ X13 @ X14 ) )
!= $true ) )
=> ( ( ( X12 @ ( sK6 @ X12 ) )
= $true )
& ( ( X12 @ ( sK7 @ X12 ) )
= $true )
& ( ( X12 @ ( cP @ ( sK6 @ X12 ) @ ( sK7 @ X12 ) ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: iS,X1: iS,X2: iS,X3: iS] :
( ( ( cP @ X3 @ X2 )
!= ( cP @ X1 @ X0 ) )
| ( ( X1 = X3 )
& ( X0 = X2 ) ) )
& ( ? [X4: iS,X5: iS,X6: iS,X7: iS] :
( ( ( X4 != X6 )
| ( X5 != X7 ) )
& ( ( cP @ X6 @ X7 )
= ( cP @ X4 @ X5 ) ) )
| ? [X8: iS,X9: iS] :
( c0
= ( cP @ X9 @ X8 ) ) )
& ! [X10: iS,X11: iS] :
( c0
!= ( cP @ X11 @ X10 ) )
& ! [X12: iS > $o] :
( ? [X13: iS,X14: iS] :
( ( ( X12 @ X13 )
= $true )
& ( ( X12 @ X14 )
= $true )
& ( ( X12 @ ( cP @ X13 @ X14 ) )
!= $true ) )
| ( ( X12 @ c0 )
!= $true )
| ! [X15: iS] :
( ( X12 @ X15 )
= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X8: iS,X7: iS,X9: iS,X6: iS] :
( ( ( cP @ X7 @ X8 )
!= ( cP @ X6 @ X9 ) )
| ( ( X6 = X7 )
& ( X8 = X9 ) ) )
& ( ? [X11: iS,X13: iS,X12: iS,X10: iS] :
( ( ( X11 != X12 )
| ( X10 != X13 ) )
& ( ( cP @ X12 @ X10 )
= ( cP @ X11 @ X13 ) ) )
| ? [X14: iS,X15: iS] :
( c0
= ( cP @ X15 @ X14 ) ) )
& ! [X4: iS,X5: iS] :
( c0
!= ( cP @ X5 @ X4 ) )
& ! [X0: iS > $o] :
( ? [X2: iS,X1: iS] :
( ( ( X0 @ X2 )
= $true )
& ( ( X0 @ X1 )
= $true )
& ( ( X0 @ ( cP @ X2 @ X1 ) )
!= $true ) )
| ( ( X0 @ c0 )
!= $true )
| ! [X3: iS] :
( ( X0 @ X3 )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( ? [X11: iS,X13: iS,X12: iS,X10: iS] :
( ( ( X11 != X12 )
| ( X10 != X13 ) )
& ( ( cP @ X12 @ X10 )
= ( cP @ X11 @ X13 ) ) )
| ? [X14: iS,X15: iS] :
( c0
= ( cP @ X15 @ X14 ) ) )
& ! [X0: iS > $o] :
( ! [X3: iS] :
( ( X0 @ X3 )
= $true )
| ? [X1: iS,X2: iS] :
( ( ( X0 @ ( cP @ X2 @ X1 ) )
!= $true )
& ( ( X0 @ X2 )
= $true )
& ( ( X0 @ X1 )
= $true ) )
| ( ( X0 @ c0 )
!= $true ) )
& ! [X4: iS,X5: iS] :
( c0
!= ( cP @ X5 @ X4 ) )
& ! [X8: iS,X7: iS,X9: iS,X6: iS] :
( ( ( cP @ X7 @ X8 )
!= ( cP @ X6 @ X9 ) )
| ( ( X6 = X7 )
& ( X8 = X9 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: iS > $o] :
( ( ! [X1: iS,X2: iS] :
( ( ( ( X0 @ X2 )
= $true )
& ( ( X0 @ X1 )
= $true ) )
=> ( ( X0 @ ( cP @ X2 @ X1 ) )
= $true ) )
& ( ( X0 @ c0 )
= $true ) )
=> ! [X3: iS] :
( ( X0 @ X3 )
= $true ) )
& ! [X4: iS,X5: iS] :
( c0
!= ( cP @ X5 @ X4 ) )
& ! [X6: iS,X9: iS,X8: iS,X7: iS] :
( ( ( cP @ X7 @ X8 )
= ( cP @ X6 @ X9 ) )
=> ( ( X6 = X7 )
& ( X8 = X9 ) ) ) )
=> ( ! [X10: iS,X12: iS,X11: iS,X13: iS] :
( ( ( cP @ X12 @ X10 )
= ( cP @ X11 @ X13 ) )
=> ( ( X10 = X13 )
& ( X11 = X12 ) ) )
& ! [X15: iS,X14: iS] :
( c0
!= ( cP @ X15 @ X14 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: iS > $o] :
( ( ! [X1: iS,X2: iS] :
( ( ( X0 @ X1 )
& ( X0 @ X2 ) )
=> ( X0 @ ( cP @ X2 @ X1 ) ) )
& ( X0 @ c0 ) )
=> ! [X3: iS] : ( X0 @ X3 ) )
& ! [X4: iS,X5: iS] :
( c0
!= ( cP @ X5 @ X4 ) )
& ! [X6: iS,X7: iS,X8: iS,X9: iS] :
( ( ( cP @ X7 @ X8 )
= ( cP @ X6 @ X9 ) )
=> ( ( X8 = X9 )
& ( X6 = X7 ) ) ) )
=> ( ! [X10: iS,X11: iS,X12: iS,X13: iS] :
( ( ( cP @ X12 @ X10 )
= ( cP @ X11 @ X13 ) )
=> ( ( X10 = X13 )
& ( X11 = X12 ) ) )
& ! [X14: iS,X15: iS] :
( c0
!= ( cP @ X15 @ X14 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X4: iS > $o] :
( ( ! [X1: iS,X0: iS] :
( ( ( X4 @ X1 )
& ( X4 @ X0 ) )
=> ( X4 @ ( cP @ X0 @ X1 ) ) )
& ( X4 @ c0 ) )
=> ! [X0: iS] : ( X4 @ X0 ) )
& ! [X1: iS,X0: iS] :
( ( cP @ X0 @ X1 )
!= c0 )
& ! [X1: iS,X0: iS,X2: iS,X3: iS] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) ) )
=> ( ! [X2: iS,X1: iS,X0: iS,X3: iS] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) )
& ! [X1: iS,X0: iS] :
( ( cP @ X0 @ X1 )
!= c0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X4: iS > $o] :
( ( ! [X1: iS,X0: iS] :
( ( ( X4 @ X1 )
& ( X4 @ X0 ) )
=> ( X4 @ ( cP @ X0 @ X1 ) ) )
& ( X4 @ c0 ) )
=> ! [X0: iS] : ( X4 @ X0 ) )
& ! [X1: iS,X0: iS] :
( ( cP @ X0 @ X1 )
!= c0 )
& ! [X1: iS,X0: iS,X2: iS,X3: iS] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) ) )
=> ( ! [X2: iS,X1: iS,X0: iS,X3: iS] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) )
& ! [X1: iS,X0: iS] :
( ( cP @ X0 @ X1 )
!= c0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_ALG02_pme) ).
thf(f51,plain,
( spl8_4
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f50,f22,f35]) ).
thf(f35,plain,
( spl8_4
<=> ( sK3 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f50,plain,
( ( sK3 = sK1 )
| ~ spl8_1 ),
inference(equality_resolution,[],[f43]) ).
thf(f43,plain,
( ! [X0: iS,X1: iS] :
( ( ( cP @ X0 @ X1 )
!= ( cP @ sK0 @ sK1 ) )
| ( sK3 = X1 ) )
| ~ spl8_1 ),
inference(superposition,[],[f19,f24]) ).
thf(f19,plain,
! [X2: iS,X3: iS,X0: iS,X1: iS] :
( ( ( cP @ X3 @ X2 )
!= ( cP @ X1 @ X0 ) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f41,plain,
~ spl8_2,
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f40,plain,
( $false
| ~ spl8_2 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( c0 != c0 )
| ~ spl8_2 ),
inference(superposition,[],[f16,f28]) ).
thf(f28,plain,
( ( c0
= ( cP @ sK5 @ sK4 ) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f26,plain,
( spl8_2
<=> ( c0
= ( cP @ sK5 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f16,plain,
! [X10: iS,X11: iS] :
( c0
!= ( cP @ X11 @ X10 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f38,plain,
( ~ spl8_3
| spl8_2
| ~ spl8_4 ),
inference(avatar_split_clause,[],[f18,f35,f26,f31]) ).
thf(f18,plain,
( ( c0
= ( cP @ sK5 @ sK4 ) )
| ( sK0 != sK2 )
| ( sK3 != sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f29,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f17,f26,f22]) ).
thf(f17,plain,
( ( ( cP @ sK2 @ sK3 )
= ( cP @ sK0 @ sK1 ) )
| ( c0
= ( cP @ sK5 @ sK4 ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SEV197^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10 % 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.10/0.30 % Computer : n020.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 18:35:08 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_EQU_NAR problem
% 0.10/0.30 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.15/0.32 % (5469)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 (2999ds/275Mi)
% 0.15/0.32 % (5468)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 (2999ds/2Mi)
% 0.15/0.32 % (5465)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 (2999ds/4Mi)
% 0.15/0.32 % (5464)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.32 % (5470)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.32 % (5467)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.32 % (5471)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.32 % (5466)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 (2999ds/27Mi)
% 0.15/0.32 % (5467)Instruction limit reached!
% 0.15/0.32 % (5467)------------------------------
% 0.15/0.32 % (5467)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (5467)Termination reason: Unknown
% 0.15/0.32 % (5467)Termination phase: Saturation
% 0.15/0.32 % (5468)Instruction limit reached!
% 0.15/0.32 % (5468)------------------------------
% 0.15/0.32 % (5468)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (5468)Termination reason: Unknown
% 0.15/0.32 % (5468)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (5468)Memory used [KB]: 1023
% 0.15/0.32 % (5468)Time elapsed: 0.003 s
% 0.15/0.32 % (5468)Instructions burned: 3 (million)
% 0.15/0.32 % (5468)------------------------------
% 0.15/0.32 % (5468)------------------------------
% 0.15/0.32 % (5467)Memory used [KB]: 5500
% 0.15/0.32 % (5467)Time elapsed: 0.003 s
% 0.15/0.32 % (5467)Instructions burned: 2 (million)
% 0.15/0.32 % (5467)------------------------------
% 0.15/0.32 % (5467)------------------------------
% 0.15/0.32 % (5471)Instruction limit reached!
% 0.15/0.32 % (5471)------------------------------
% 0.15/0.32 % (5471)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (5471)Termination reason: Unknown
% 0.15/0.32 % (5471)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (5471)Memory used [KB]: 5500
% 0.15/0.32 % (5471)Time elapsed: 0.004 s
% 0.15/0.32 % (5471)Instructions burned: 4 (million)
% 0.15/0.32 % (5471)------------------------------
% 0.15/0.32 % (5471)------------------------------
% 0.15/0.32 % (5465)Instruction limit reached!
% 0.15/0.32 % (5465)------------------------------
% 0.15/0.32 % (5465)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (5465)Termination reason: Unknown
% 0.15/0.32 % (5465)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (5465)Memory used [KB]: 5500
% 0.15/0.32 % (5465)Time elapsed: 0.005 s
% 0.15/0.32 % (5465)Instructions burned: 4 (million)
% 0.15/0.32 % (5465)------------------------------
% 0.15/0.32 % (5465)------------------------------
% 0.15/0.32 % (5466)First to succeed.
% 0.15/0.33 % (5470)Also succeeded, but the first one will report.
% 0.15/0.33 % (5466)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33 % (5466)------------------------------
% 0.15/0.33 % (5466)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (5466)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (5466)Memory used [KB]: 5500
% 0.15/0.33 % (5466)Time elapsed: 0.006 s
% 0.15/0.33 % (5466)Instructions burned: 4 (million)
% 0.15/0.33 % (5466)------------------------------
% 0.15/0.33 % (5466)------------------------------
% 0.15/0.33 % (5463)Success in time 0.009 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------