TSTP Solution File: SEV397^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV397^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 : n024.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:13:39 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 359 ( 109 equ; 0 cnn)
% Maximal formula atoms : 28 ( 14 avg)
% Number of connectives : 297 ( 51 ~; 67 |; 40 &; 130 @)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 ^ 4 !; 4 ?; 9 :)
% ( 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_5,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_8,type,
sK0: a ).
thf(f58,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f53,f54,f56]) ).
thf(f56,plain,
( ~ spl1_1
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f24,f44,f35]) ).
thf(f35,plain,
( spl1_1
<=> ( $true
= ( cX @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
thf(f44,plain,
( spl1_3
<=> ( $true
= ( cY @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
thf(f24,plain,
( ( $true
!= ( cX @ sK0 ) )
| ( $true
!= ( cY @ sK0 ) ) ),
inference(duplicate_literal_removal,[],[f19]) ).
thf(f19,plain,
( ( $true
!= ( cY @ sK0 ) )
| ( $true
!= ( cX @ sK0 ) )
| ( $true
!= ( cX @ sK0 ) )
| ( $true
!= ( cY @ sK0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( ( ( $true
!= ( cY @ sK0 ) )
| ( $true
!= ( cX @ sK0 ) ) )
& ( $true
!= ( cZ @ sK0 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( $true
!= ( cX @ sK0 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( $true
!= ( cY @ sK0 ) ) ) )
& ( ( ( $true
= ( cY @ sK0 ) )
& ( $true
= ( cX @ sK0 ) ) )
| ( $true
= ( cZ @ sK0 ) )
| ( ( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cX @ sK0 ) ) )
& ( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cY @ sK0 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a] :
( ( ( ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) )
& ( ( cZ @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cX @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cY @ X0 )
!= $true ) ) )
& ( ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) ) ) )
=> ( ( ( ( ( $true
!= ( cY @ sK0 ) )
| ( $true
!= ( cX @ sK0 ) ) )
& ( $true
!= ( cZ @ sK0 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( $true
!= ( cX @ sK0 ) ) )
| ( ( $true
!= ( cZ @ sK0 ) )
& ( $true
!= ( cY @ sK0 ) ) ) )
& ( ( ( $true
= ( cY @ sK0 ) )
& ( $true
= ( cX @ sK0 ) ) )
| ( $true
= ( cZ @ sK0 ) )
| ( ( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cX @ sK0 ) ) )
& ( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cY @ sK0 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a] :
( ( ( ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) )
& ( ( cZ @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cX @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cY @ X0 )
!= $true ) ) )
& ( ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ( ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) )
& ( ( cZ @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cX @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cY @ X0 )
!= $true ) ) )
& ( ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) )
<~> ( ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) )
<=> ( ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( cZ @ X0 )
| ( ( cX @ X0 )
& ( cY @ X0 ) ) )
<=> ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( cZ @ X0 )
| ( ( cX @ X0 )
& ( cY @ X0 ) ) )
<=> ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ( cZ @ X0 )
| ( ( cX @ X0 )
& ( cY @ X0 ) ) )
<=> ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM59_pme) ).
thf(f54,plain,
~ spl1_2,
inference(avatar_split_clause,[],[f26,f39]) ).
thf(f39,plain,
( spl1_2
<=> ( $true
= ( cZ @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f26,plain,
( $true
!= ( cZ @ sK0 ) ),
inference(duplicate_literal_removal,[],[f18]) ).
thf(f18,plain,
( ( $true
!= ( cZ @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f53,plain,
( spl1_3
| spl1_2 ),
inference(avatar_split_clause,[],[f27,f39,f44]) ).
thf(f27,plain,
( ( $true
= ( cY @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(duplicate_literal_removal,[],[f13]) ).
thf(f13,plain,
( ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cY @ sK0 ) )
| ( $true
= ( cY @ sK0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f42,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f33,f39,f35]) ).
thf(f33,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(duplicate_literal_removal,[],[f12]) ).
thf(f12,plain,
( ( $true
= ( cX @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) )
| ( $true
= ( cX @ sK0 ) )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV397^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.10 % 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.10/0.30 % Computer : n024.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:38:37 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_NEQ_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/sandbox/benchmark/theBenchmark.p
% 0.15/0.32 % (2552)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.15/0.32 % (2553)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.15/0.32 % (2551)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.15/0.32 % (2555)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.15/0.32 % (2556)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.15/0.32 % (2557)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (2554)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (2558)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.15/0.32 % (2554)Instruction limit reached!
% 0.15/0.32 % (2554)------------------------------
% 0.15/0.32 % (2554)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2554)Termination reason: Unknown
% 0.15/0.32 % (2554)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (2555)Instruction limit reached!
% 0.15/0.32 % (2555)------------------------------
% 0.15/0.32 % (2555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2555)Termination reason: Unknown
% 0.15/0.32 % (2555)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (2555)Memory used [KB]: 5500
% 0.15/0.32 % (2555)Time elapsed: 0.003 s
% 0.15/0.32 % (2555)Instructions burned: 2 (million)
% 0.15/0.32 % (2555)------------------------------
% 0.15/0.32 % (2555)------------------------------
% 0.15/0.32 % (2554)Memory used [KB]: 5500
% 0.15/0.32 % (2554)Time elapsed: 0.003 s
% 0.15/0.32 % (2554)Instructions burned: 2 (million)
% 0.15/0.32 % (2553)First to succeed.
% 0.15/0.32 % (2554)------------------------------
% 0.15/0.32 % (2554)------------------------------
% 0.15/0.32 % (2556)Also succeeded, but the first one will report.
% 0.15/0.32 % (2558)Instruction limit reached!
% 0.15/0.32 % (2558)------------------------------
% 0.15/0.32 % (2558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2558)Termination reason: Unknown
% 0.15/0.32 % (2558)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (2558)Memory used [KB]: 5500
% 0.15/0.32 % (2558)Time elapsed: 0.004 s
% 0.15/0.32 % (2558)Instructions burned: 3 (million)
% 0.15/0.32 % (2558)------------------------------
% 0.15/0.32 % (2558)------------------------------
% 0.15/0.32 % (2551)Also succeeded, but the first one will report.
% 0.15/0.32 % (2553)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (2553)------------------------------
% 0.15/0.32 % (2553)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (2553)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (2553)Memory used [KB]: 5500
% 0.15/0.32 % (2553)Time elapsed: 0.004 s
% 0.15/0.32 % (2553)Instructions burned: 2 (million)
% 0.15/0.32 % (2553)------------------------------
% 0.15/0.32 % (2553)------------------------------
% 0.15/0.32 % (2550)Success in time 0.015 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------