TSTP Solution File: SEV241^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV241^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 : n003.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:30 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 36 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 164 ( 55 equ; 0 cnn)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 115 ( 23 ~; 21 |; 21 &; 38 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 10 !; 8 ?; 19 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cW: a > $o ).
thf(func_def_2,type,
cU: a > $o ).
thf(func_def_6,type,
sK0: a ).
thf(func_def_7,type,
sK1: a > $o ).
thf(func_def_9,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
sK4: a ).
thf(func_def_12,type,
sK5: a ).
thf(f39,plain,
$false,
inference(avatar_sat_refutation,[],[f23,f28,f38]) ).
thf(f38,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f37]) ).
thf(f37,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f36,f14]) ).
thf(f14,plain,
( ( cW @ sK0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( cW @ sK0 )
= $true )
& ( ( cU = sK1 )
| ( cW = sK1 ) )
& ( ( sK1 @ sK0 )
!= $true )
& ( ( cU @ sK0 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: a] :
( ( ( cW @ X0 )
= $true )
& ? [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
& ( ( cU @ X0 )
= $true ) )
=> ( ( ( cW @ sK0 )
= $true )
& ? [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
& ( ( X1 @ sK0 )
!= $true ) )
& ( ( cU @ sK0 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
& ( ( X1 @ sK0 )
!= $true ) )
=> ( ( ( cU = sK1 )
| ( cW = sK1 ) )
& ( ( sK1 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a] :
( ( ( cW @ X0 )
= $true )
& ? [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
& ( ( cU @ X0 )
= $true ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
& ( ( cU @ X0 )
= $true )
& ( ( cW @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ( ( ( cU @ X0 )
= $true )
& ( ( cW @ X0 )
= $true ) )
=> ! [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
=> ( ( X1 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
=> ( X1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
=> ( X1 @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( cU = X1 )
| ( cW = X1 ) )
=> ( X1 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5201A_pme) ).
thf(f36,plain,
( ( ( cW @ sK0 )
!= $true )
| ~ spl2_1 ),
inference(superposition,[],[f12,f29]) ).
thf(f29,plain,
( ! [X1: a] :
( ( cW @ X1 )
= ( sK1 @ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f18]) ).
thf(f18,plain,
( ( cW = sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f16]) ).
thf(f16,plain,
( spl2_1
<=> ( cW = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f12,plain,
( ( sK1 @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f28,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f27]) ).
thf(f27,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f26,f11]) ).
thf(f11,plain,
( ( cU @ sK0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f26,plain,
( ( ( cU @ sK0 )
!= $true )
| ~ spl2_2 ),
inference(superposition,[],[f12,f24]) ).
thf(f24,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( cU @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f22]) ).
thf(f22,plain,
( ( cU = sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f20,plain,
( spl2_2
<=> ( cU = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f23,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f13,f20,f16]) ).
thf(f13,plain,
( ( cU = sK1 )
| ( cW = sK1 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV241^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 18:55:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.21/0.38 % (3600)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.21/0.38 % (3602)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.38 % (3603)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.21/0.38 % (3599)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.21/0.38 % (3604)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.21/0.38 % (3603)Instruction limit reached!
% 0.21/0.38 % (3603)------------------------------
% 0.21/0.38 % (3603)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (3603)Termination reason: Unknown
% 0.21/0.38 % (3603)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (3603)Memory used [KB]: 5373
% 0.21/0.38 % (3603)Time elapsed: 0.003 s
% 0.21/0.38 % (3603)Instructions burned: 2 (million)
% 0.21/0.38 % (3603)------------------------------
% 0.21/0.38 % (3603)------------------------------
% 0.21/0.38 % (3606)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.21/0.38 % (3605)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.38 % (3602)Instruction limit reached!
% 0.21/0.38 % (3602)------------------------------
% 0.21/0.38 % (3602)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (3602)Termination reason: Unknown
% 0.21/0.38 % (3602)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (3602)Memory used [KB]: 5500
% 0.21/0.38 % (3602)Time elapsed: 0.004 s
% 0.21/0.38 % (3602)Instructions burned: 2 (million)
% 0.21/0.38 % (3602)------------------------------
% 0.21/0.38 % (3602)------------------------------
% 0.21/0.38 % (3600)Instruction limit reached!
% 0.21/0.38 % (3600)------------------------------
% 0.21/0.38 % (3600)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (3606)First to succeed.
% 0.21/0.38 % (3600)Termination reason: Unknown
% 0.21/0.38 % (3600)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (3600)Memory used [KB]: 5500
% 0.21/0.38 % (3600)Time elapsed: 0.006 s
% 0.21/0.38 % (3600)Instructions burned: 4 (million)
% 0.21/0.38 % (3600)------------------------------
% 0.21/0.38 % (3600)------------------------------
% 0.21/0.38 % (3604)Also succeeded, but the first one will report.
% 0.21/0.38 % (3606)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (3606)------------------------------
% 0.21/0.38 % (3606)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (3606)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (3606)Memory used [KB]: 5500
% 0.21/0.38 % (3606)Time elapsed: 0.005 s
% 0.21/0.38 % (3606)Instructions burned: 2 (million)
% 0.21/0.38 % (3606)------------------------------
% 0.21/0.38 % (3606)------------------------------
% 0.21/0.38 % (3598)Success in time 0.005 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------