TSTP Solution File: SET633^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET633^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 03:12:35 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 2 unt; 6 typ; 0 def)
% Number of atoms : 344 ( 127 equ; 0 cnn)
% Maximal formula atoms : 22 ( 9 avg)
% Number of connectives : 395 ( 83 ~; 69 |; 61 &; 158 @)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 62 ( 0 ^ 44 !; 18 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a ).
thf(f40,plain,
$false,
inference(avatar_sat_refutation,[],[f28,f29,f34,f39]) ).
thf(f39,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f38]) ).
thf(f38,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f37,f14]) ).
thf(f14,plain,
( $true
!= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X3: a] :
( ( ( sK0 @ X3 )
= $true )
| ( $true
!= ( sK2 @ X3 ) )
| ( $true
= ( sK1 @ X3 ) ) )
& ( ( ( $true
!= ( sK2 @ sK3 ) )
& ( $true
= ( sK1 @ sK3 ) ) )
| ( ( $true
!= ( sK1 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) ) ) )
& ( $true
!= ( sK0 @ sK3 ) )
& ! [X5: a] :
( ( $true
= ( sK2 @ X5 ) )
| ( ( sK0 @ X5 )
= $true )
| ( $true
!= ( sK1 @ X5 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) )
& ? [X4: a] :
( ( ( ( $true
!= ( X2 @ X4 ) )
& ( $true
= ( X1 @ X4 ) ) )
| ( ( $true
!= ( X1 @ X4 ) )
& ( $true
= ( X2 @ X4 ) ) ) )
& ( $true
!= ( X0 @ X4 ) ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( ( X0 @ X5 )
= $true )
| ( $true
!= ( X1 @ X5 ) ) ) )
=> ( ! [X3: a] :
( ( ( sK0 @ X3 )
= $true )
| ( $true
!= ( sK2 @ X3 ) )
| ( $true
= ( sK1 @ X3 ) ) )
& ? [X4: a] :
( ( ( ( $true
!= ( sK2 @ X4 ) )
& ( $true
= ( sK1 @ X4 ) ) )
| ( ( $true
!= ( sK1 @ X4 ) )
& ( $true
= ( sK2 @ X4 ) ) ) )
& ( $true
!= ( sK0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( sK2 @ X5 ) )
| ( ( sK0 @ X5 )
= $true )
| ( $true
!= ( sK1 @ X5 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: a] :
( ( ( ( $true
!= ( sK2 @ X4 ) )
& ( $true
= ( sK1 @ X4 ) ) )
| ( ( $true
!= ( sK1 @ X4 ) )
& ( $true
= ( sK2 @ X4 ) ) ) )
& ( $true
!= ( sK0 @ X4 ) ) )
=> ( ( ( ( $true
!= ( sK2 @ sK3 ) )
& ( $true
= ( sK1 @ sK3 ) ) )
| ( ( $true
!= ( sK1 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) ) ) )
& ( $true
!= ( sK0 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) )
& ? [X4: a] :
( ( ( ( $true
!= ( X2 @ X4 ) )
& ( $true
= ( X1 @ X4 ) ) )
| ( ( $true
!= ( X1 @ X4 ) )
& ( $true
= ( X2 @ X4 ) ) ) )
& ( $true
!= ( X0 @ X4 ) ) )
& ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
| ( ( X0 @ X5 )
= $true )
| ( $true
!= ( X1 @ X5 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a > $o,X2: a > $o,X1: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ? [X5: a] :
( ( ( ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
= $true ) )
| ( ( ( X2 @ X5 )
!= $true )
& ( $true
= ( X1 @ X5 ) ) ) )
& ( ( X0 @ X5 )
!= $true ) )
& ! [X4: a] :
( ( $true
= ( X1 @ X4 ) )
| ( $true
= ( X0 @ X4 ) )
| ( $true
!= ( X2 @ X4 ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X1: a > $o,X0: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( ( ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
= $true ) )
| ( ( ( X2 @ X5 )
!= $true )
& ( $true
= ( X1 @ X5 ) ) ) )
& ( ( X0 @ X5 )
!= $true ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
| ( $true
= ( X1 @ X4 ) )
| ( $true
!= ( X2 @ X4 ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true ) )
=> ( ( X0 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( $true
!= ( X1 @ X4 ) )
& ( $true
= ( X2 @ X4 ) ) )
=> ( $true
= ( X0 @ X4 ) ) ) )
=> ! [X5: a] :
( ( ( ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
= $true ) )
| ( ( ( X2 @ X5 )
!= $true )
& ( $true
= ( X1 @ X5 ) ) ) )
=> ( ( X0 @ X5 )
= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( ( X1 @ X3 )
= $true )
& ( ( X2 @ X3 )
!= $true ) )
=> ( ( X0 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( $true
= ( X2 @ X4 ) )
& ( $true
!= ( X1 @ X4 ) ) )
=> ( $true
= ( X0 @ X4 ) ) ) )
=> ! [X5: a] :
( ( ( ( ( X2 @ X5 )
!= $true )
& ( $true
= ( X1 @ X5 ) ) )
| ( ( ( X2 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) ) )
=> ( ( X0 @ X5 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( X1 @ X3 )
& ~ ( X2 @ X3 ) )
=> ( X0 @ X3 ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
& ~ ( X1 @ X4 ) )
=> ( X0 @ X4 ) ) )
=> ! [X5: a] :
( ( ( ~ ( X2 @ X5 )
& ( X1 @ X5 ) )
| ( ( X2 @ X5 )
& ~ ( X1 @ X5 ) ) )
=> ( X0 @ X5 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( ( X1 @ X3 )
& ~ ( X0 @ X3 ) )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X1 @ X3 ) )
=> ( X2 @ X3 ) ) )
=> ! [X3: a] :
( ( ( ~ ( X0 @ X3 )
& ( X1 @ X3 ) )
| ( ( X0 @ X3 )
& ~ ( X1 @ X3 ) ) )
=> ( X2 @ X3 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( ( X1 @ X3 )
& ~ ( X0 @ X3 ) )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X1 @ X3 ) )
=> ( X2 @ X3 ) ) )
=> ! [X3: a] :
( ( ( ~ ( X0 @ X3 )
& ( X1 @ X3 ) )
| ( ( X0 @ X3 )
& ~ ( X1 @ X3 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_115_pme) ).
thf(f37,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f36,f27]) ).
thf(f27,plain,
( ( $true
!= ( sK2 @ sK3 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl4_2
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f36,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $true != $true )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_1 ),
inference(superposition,[],[f13,f22]) ).
thf(f22,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f21,plain,
( spl4_1
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f13,plain,
! [X5: a] :
( ( $true
!= ( sK1 @ X5 ) )
| ( ( sK0 @ X5 )
= $true )
| ( $true
= ( sK2 @ X5 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f34,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f33]) ).
thf(f33,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f32,f14]) ).
thf(f32,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f31,f23]) ).
thf(f23,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| spl4_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f31,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true != $true )
| ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_2 ),
inference(superposition,[],[f19,f26]) ).
thf(f26,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f19,plain,
! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( ( sK0 @ X3 )
= $true )
| ( $true
= ( sK1 @ X3 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f29,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f15,f25,f21]) ).
thf(f15,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f28,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f18,f25,f21]) ).
thf(f18,plain,
( ( $true
!= ( sK2 @ sK3 ) )
| ( $true
!= ( sK1 @ sK3 ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET633^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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 : n017.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 13:06:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.20/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.20/0.38 % (13530)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.20/0.38 % (13528)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.20/0.38 % (13529)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.38 % (13527)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.20/0.38 % (13533)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.20/0.38 % (13531)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.20/0.38 % (13529)Instruction limit reached!
% 0.20/0.38 % (13529)------------------------------
% 0.20/0.38 % (13529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (13529)Termination reason: Unknown
% 0.20/0.38 % (13529)Termination phase: Saturation
% 0.20/0.38 % (13530)Instruction limit reached!
% 0.20/0.38 % (13530)------------------------------
% 0.20/0.38 % (13530)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38
% 0.20/0.38 % (13529)Memory used [KB]: 5500
% 0.20/0.38 % (13529)Time elapsed: 0.003 s
% 0.20/0.38 % (13529)Instructions burned: 2 (million)
% 0.20/0.38 % (13529)------------------------------
% 0.20/0.38 % (13529)------------------------------
% 0.20/0.38 % (13530)Termination reason: Unknown
% 0.20/0.38 % (13530)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (13530)Memory used [KB]: 5500
% 0.20/0.38 % (13530)Time elapsed: 0.003 s
% 0.20/0.38 % (13530)Instructions burned: 2 (million)
% 0.20/0.38 % (13530)------------------------------
% 0.20/0.38 % (13530)------------------------------
% 0.20/0.38 % (13533)First to succeed.
% 0.20/0.38 % (13531)Also succeeded, but the first one will report.
% 0.20/0.38 % (13527)Also succeeded, but the first one will report.
% 0.20/0.38 % (13533)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (13533)------------------------------
% 0.20/0.38 % (13533)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (13533)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (13533)Memory used [KB]: 5500
% 0.20/0.38 % (13533)Time elapsed: 0.005 s
% 0.20/0.38 % (13533)Instructions burned: 2 (million)
% 0.20/0.38 % (13533)------------------------------
% 0.20/0.38 % (13533)------------------------------
% 0.20/0.38 % (13525)Success in time 0.018 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------