TSTP Solution File: SET589^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET589^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 : n005.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 03:12:14 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 37 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 235 ( 90 equ; 0 cnn)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 265 ( 56 ~; 31 |; 43 &; 111 @)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 0 ^ 49 !; 22 ?; 72 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_8,type,
sK3: a > $o ).
thf(func_def_9,type,
sK4: a ).
thf(f35,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f29,f34]) ).
thf(f34,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f33]) ).
thf(f33,plain,
( $false
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
( ( $true != $true )
| ~ spl5_1 ),
inference(superposition,[],[f14,f31]) ).
thf(f31,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
( ( $true != $true )
| ( $true
= ( sK1 @ sK4 ) )
| ~ spl5_1 ),
inference(superposition,[],[f17,f21]) ).
thf(f21,plain,
( ( $true
= ( sK2 @ sK4 ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl5_1
<=> ( $true
= ( sK2 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f17,plain,
! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( ( sK1 @ X4 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( ( sK1 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( sK3 @ X5 )
= $true )
| ( ( sK0 @ X5 )
!= $true ) )
& ( $true
= ( sK0 @ sK4 ) )
& ( $true
!= ( sK1 @ sK4 ) )
& ( ( $true
= ( sK2 @ sK4 ) )
| ( ( sK3 @ sK4 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( ( X1 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X3 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ? [X6: a] :
( ( $true
= ( X0 @ X6 ) )
& ( $true
!= ( X1 @ X6 ) )
& ( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
=> ( ! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( ( sK1 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( sK3 @ X5 )
= $true )
| ( ( sK0 @ X5 )
!= $true ) )
& ? [X6: a] :
( ( $true
= ( sK0 @ X6 ) )
& ( $true
!= ( sK1 @ X6 ) )
& ( ( $true
= ( sK2 @ X6 ) )
| ( $true
!= ( sK3 @ X6 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X6: a] :
( ( $true
= ( sK0 @ X6 ) )
& ( $true
!= ( sK1 @ X6 ) )
& ( ( $true
= ( sK2 @ X6 ) )
| ( $true
!= ( sK3 @ X6 ) ) ) )
=> ( ( $true
= ( sK0 @ sK4 ) )
& ( $true
!= ( sK1 @ sK4 ) )
& ( ( $true
= ( sK2 @ sK4 ) )
| ( ( sK3 @ sK4 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( ( X1 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X3 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ? [X6: a] :
( ( $true
= ( X0 @ X6 ) )
& ( $true
!= ( X1 @ X6 ) )
& ( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a > $o,X3: a > $o,X1: a > $o,X2: a > $o] :
( ! [X4: a] :
( ( ( X1 @ X4 )
!= $true )
| ( ( X3 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ? [X6: a] :
( ( $true
= ( X0 @ X6 ) )
& ( ( X3 @ X6 )
!= $true )
& ( ( $true
= ( X1 @ X6 ) )
| ( $true
!= ( X2 @ X6 ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X2: a > $o,X3: a > $o,X1: a > $o,X0: a > $o] :
( ? [X6: a] :
( ( ( $true
= ( X1 @ X6 ) )
| ( $true
!= ( X2 @ X6 ) ) )
& ( ( X3 @ X6 )
!= $true )
& ( $true
= ( X0 @ X6 ) ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
!= $true )
| ( ( X3 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X2: a > $o,X3: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X4: a] :
( ( ( X1 @ X4 )
= $true )
=> ( ( X3 @ X4 )
= $true ) )
& ! [X5: a] :
( ( $true
= ( X0 @ X5 ) )
=> ( ( X2 @ X5 )
= $true ) ) )
=> ! [X6: a] :
( ( ( ( X3 @ X6 )
!= $true )
& ( $true
= ( X0 @ X6 ) ) )
=> ( ( $true
!= ( X1 @ X6 ) )
& ( $true
= ( X2 @ X6 ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( ( X1 @ X4 )
= $true )
=> ( ( X3 @ X4 )
= $true ) )
& ! [X5: a] :
( ( $true
= ( X0 @ X5 ) )
=> ( ( X2 @ X5 )
= $true ) ) )
=> ! [X6: a] :
( ( ( $true
= ( X0 @ X6 ) )
& ( ( X3 @ X6 )
!= $true ) )
=> ( ( $true
= ( X2 @ X6 ) )
& ( $true
!= ( X1 @ X6 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) )
& ! [X5: a] :
( ( X0 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X6: a] :
( ( ( X0 @ X6 )
& ~ ( X3 @ X6 ) )
=> ( ( X2 @ X6 )
& ~ ( X1 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a > $o,X1: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X0 @ X4 )
& ~ ( X3 @ X4 ) )
=> ( ( X1 @ X4 )
& ~ ( X2 @ X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X2: a > $o,X1: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X0 @ X4 )
& ~ ( X3 @ X4 ) )
=> ( ( X1 @ X4 )
& ~ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_48_pme) ).
thf(f14,plain,
( $true
!= ( sK1 @ sK4 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f29,plain,
spl5_2,
inference(avatar_split_clause,[],[f28,f23]) ).
thf(f23,plain,
( spl5_2
<=> ( ( sK3 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f28,plain,
( ( sK3 @ sK4 )
= $true ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f27,plain,
( ( ( sK3 @ sK4 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f16,f15]) ).
thf(f15,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
! [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
| ( ( sK3 @ X5 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f26,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f13,f23,f19]) ).
thf(f13,plain,
( ( ( sK3 @ sK4 )
!= $true )
| ( $true
= ( sK2 @ sK4 ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET589^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.15 % 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.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 12:42:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/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.14/0.38 % (6644)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.38 % (6644)First to succeed.
% 0.14/0.38 % (6645)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (6646)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.38 % (6643)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.38 % (6647)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.38 % (6642)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.38 % (6648)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.38 % (6649)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.14/0.38 % (6644)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (6644)------------------------------
% 0.14/0.38 % (6644)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6644)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (6644)Memory used [KB]: 5500
% 0.14/0.38 % (6644)Time elapsed: 0.005 s
% 0.14/0.38 % (6644)Instructions burned: 3 (million)
% 0.14/0.38 % (6644)------------------------------
% 0.14/0.38 % (6644)------------------------------
% 0.14/0.38 % (6641)Success in time 0.003 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------