TSTP Solution File: SEV060^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV060^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 : 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 04:11:52 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 35 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 178 ( 89 equ; 0 cnn)
% Maximal formula atoms : 14 ( 7 avg)
% Number of connectives : 263 ( 39 ~; 27 |; 36 &; 144 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 84 ( 0 ^ 56 !; 28 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_5,type,
sK0: b > a > $o ).
thf(func_def_6,type,
sK1: a ).
thf(func_def_7,type,
sK2: b > a > $o ).
thf(func_def_8,type,
sK3: b ).
thf(func_def_9,type,
sK4: b ).
thf(func_def_10,type,
sK5: a ).
thf(f29,plain,
$false,
inference(subsumption_resolution,[],[f28,f15]) ).
thf(f15,plain,
( $true
!= ( sK2 @ sK3 @ sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( ( sK0 @ sK4 @ sK5 )
!= $true )
& ( $true
= ( sK2 @ sK4 @ sK5 ) )
& ( $true
!= ( sK2 @ sK3 @ sK1 ) )
& ! [X6: b,X7: a] :
( ( $true
!= ( sK2 @ X6 @ X7 ) )
| ( ( sK1 = X7 )
& ( sK3 = X6 ) )
| ( $true
= ( sK0 @ X6 @ X7 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: b > a > $o,X1: a,X2: b > a > $o,X3: b] :
( ? [X4: b,X5: a] :
( ( $true
!= ( X0 @ X4 @ X5 ) )
& ( ( X2 @ X4 @ X5 )
= $true ) )
& ( $true
!= ( X2 @ X3 @ X1 ) )
& ! [X6: b,X7: a] :
( ( ( X2 @ X6 @ X7 )
!= $true )
| ( ( X1 = X7 )
& ( X3 = X6 ) )
| ( $true
= ( X0 @ X6 @ X7 ) ) ) )
=> ( ? [X5: a,X4: b] :
( ( $true
!= ( sK0 @ X4 @ X5 ) )
& ( $true
= ( sK2 @ X4 @ X5 ) ) )
& ( $true
!= ( sK2 @ sK3 @ sK1 ) )
& ! [X7: a,X6: b] :
( ( $true
!= ( sK2 @ X6 @ X7 ) )
| ( ( sK1 = X7 )
& ( sK3 = X6 ) )
| ( $true
= ( sK0 @ X6 @ X7 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X5: a,X4: b] :
( ( $true
!= ( sK0 @ X4 @ X5 ) )
& ( $true
= ( sK2 @ X4 @ X5 ) ) )
=> ( ( ( sK0 @ sK4 @ sK5 )
!= $true )
& ( $true
= ( sK2 @ sK4 @ sK5 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: b > a > $o,X1: a,X2: b > a > $o,X3: b] :
( ? [X4: b,X5: a] :
( ( $true
!= ( X0 @ X4 @ X5 ) )
& ( ( X2 @ X4 @ X5 )
= $true ) )
& ( $true
!= ( X2 @ X3 @ X1 ) )
& ! [X6: b,X7: a] :
( ( ( X2 @ X6 @ X7 )
!= $true )
| ( ( X1 = X7 )
& ( X3 = X6 ) )
| ( $true
= ( X0 @ X6 @ X7 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X3: b > a > $o,X2: a,X0: b > a > $o,X1: b] :
( ? [X7: b,X6: a] :
( ( $true
!= ( X3 @ X7 @ X6 ) )
& ( $true
= ( X0 @ X7 @ X6 ) ) )
& ( $true
!= ( X0 @ X1 @ X2 ) )
& ! [X5: b,X4: a] :
( ( $true
!= ( X0 @ X5 @ X4 ) )
| ( ( X2 = X4 )
& ( X1 = X5 ) )
| ( $true
= ( X3 @ X5 @ X4 ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X1: b,X0: b > a > $o,X3: b > a > $o,X2: a] :
( ? [X7: b,X6: a] :
( ( $true
!= ( X3 @ X7 @ X6 ) )
& ( $true
= ( X0 @ X7 @ X6 ) ) )
& ! [X5: b,X4: a] :
( ( ( X2 = X4 )
& ( X1 = X5 ) )
| ( $true
= ( X3 @ X5 @ X4 ) )
| ( $true
!= ( X0 @ X5 @ X4 ) ) )
& ( $true
!= ( X0 @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X1: b,X0: b > a > $o,X3: b > a > $o,X2: a] :
( ( ! [X5: b,X4: a] :
( ( $true
= ( X0 @ X5 @ X4 ) )
=> ( ( ( X2 = X4 )
& ( X1 = X5 ) )
| ( $true
= ( X3 @ X5 @ X4 ) ) ) )
& ( $true
!= ( X0 @ X1 @ X2 ) ) )
=> ! [X7: b,X6: a] :
( ( $true
= ( X0 @ X7 @ X6 ) )
=> ( $true
= ( X3 @ X7 @ X6 ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: b > a > $o,X1: b,X2: a,X3: b > a > $o] :
( ( ( $true
!= ( X0 @ X1 @ X2 ) )
& ! [X5: b,X4: a] :
( ( $true
= ( X0 @ X5 @ X4 ) )
=> ( ( ( X2 = X4 )
& ( X1 = X5 ) )
| ( $true
= ( X3 @ X5 @ X4 ) ) ) ) )
=> ! [X7: b,X6: a] :
( ( $true
= ( X0 @ X7 @ X6 ) )
=> ( $true
= ( X3 @ X7 @ X6 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: b > a > $o,X1: b,X2: a,X3: b > a > $o] :
( ( ~ ( X0 @ X1 @ X2 )
& ! [X4: a,X5: b] :
( ( X0 @ X5 @ X4 )
=> ( ( X3 @ X5 @ X4 )
| ( ( X2 = X4 )
& ( X1 = X5 ) ) ) ) )
=> ! [X6: a,X7: b] :
( ( X0 @ X7 @ X6 )
=> ( X3 @ X7 @ X6 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X3: b > a > $o,X0: b,X1: a,X2: b > a > $o] :
( ( ~ ( X3 @ X0 @ X1 )
& ! [X5: a,X4: b] :
( ( X3 @ X4 @ X5 )
=> ( ( X2 @ X4 @ X5 )
| ( ( X1 = X5 )
& ( X0 = X4 ) ) ) ) )
=> ! [X7: a,X6: b] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X3: b > a > $o,X0: b,X1: a,X2: b > a > $o] :
( ( ~ ( X3 @ X0 @ X1 )
& ! [X5: a,X4: b] :
( ( X3 @ X4 @ X5 )
=> ( ( X2 @ X4 @ X5 )
| ( ( X1 = X5 )
& ( X0 = X4 ) ) ) ) )
=> ! [X7: a,X6: b] :
( ( X3 @ X6 @ X7 )
=> ( X2 @ X6 @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM173_pme) ).
thf(f28,plain,
( $true
= ( sK2 @ sK3 @ sK1 ) ),
inference(forward_demodulation,[],[f27,f20]) ).
thf(f20,plain,
sK3 = sK4,
inference(subsumption_resolution,[],[f19,f16]) ).
thf(f16,plain,
( $true
= ( sK2 @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f19,plain,
( ( sK3 = sK4 )
| ( $true
!= ( sK2 @ sK4 @ sK5 ) ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
( ( $true
!= ( sK2 @ sK4 @ sK5 ) )
| ( sK3 = sK4 )
| ( $true != $true ) ),
inference(superposition,[],[f17,f13]) ).
thf(f13,plain,
! [X6: b,X7: a] :
( ( $true
= ( sK0 @ X6 @ X7 ) )
| ( $true
!= ( sK2 @ X6 @ X7 ) )
| ( sK3 = X6 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
( ( sK0 @ sK4 @ sK5 )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f27,plain,
( $true
= ( sK2 @ sK4 @ sK1 ) ),
inference(superposition,[],[f16,f25]) ).
thf(f25,plain,
sK5 = sK1,
inference(subsumption_resolution,[],[f24,f16]) ).
thf(f24,plain,
( ( $true
!= ( sK2 @ sK4 @ sK5 ) )
| ( sK5 = sK1 ) ),
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
( ( $true != $true )
| ( sK5 = sK1 )
| ( $true
!= ( sK2 @ sK4 @ sK5 ) ) ),
inference(superposition,[],[f17,f14]) ).
thf(f14,plain,
! [X6: b,X7: a] :
( ( $true
= ( sK0 @ X6 @ X7 ) )
| ( sK1 = X7 )
| ( $true
!= ( sK2 @ X6 @ X7 ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % 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.13/0.35 % Computer : n017.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 19:19:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 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.13/0.37 % (30242)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.13/0.37 % (30240)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.13/0.37 % (30243)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (30244)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.13/0.37 % (30245)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.13/0.37 % (30246)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (30243)Instruction limit reached!
% 0.13/0.37 % (30243)------------------------------
% 0.13/0.37 % (30243)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (30244)Instruction limit reached!
% 0.13/0.37 % (30244)------------------------------
% 0.13/0.37 % (30244)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (30244)Termination reason: Unknown
% 0.13/0.37 % (30244)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (30244)Memory used [KB]: 895
% 0.13/0.37 % (30244)Time elapsed: 0.003 s
% 0.13/0.37 % (30244)Instructions burned: 2 (million)
% 0.13/0.37 % (30244)------------------------------
% 0.13/0.37 % (30244)------------------------------
% 0.13/0.37 % (30243)Termination reason: Unknown
% 0.13/0.37 % (30243)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (30243)Memory used [KB]: 5500
% 0.13/0.37 % (30243)Time elapsed: 0.003 s
% 0.13/0.37 % (30243)Instructions burned: 2 (million)
% 0.13/0.37 % (30243)------------------------------
% 0.13/0.37 % (30243)------------------------------
% 0.13/0.37 % (30245)First to succeed.
% 0.13/0.37 % (30241)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.13/0.38 % (30246)Also succeeded, but the first one will report.
% 0.13/0.38 % (30240)Also succeeded, but the first one will report.
% 0.13/0.38 % (30245)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (30245)------------------------------
% 0.13/0.38 % (30245)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (30245)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (30245)Memory used [KB]: 5500
% 0.13/0.38 % (30245)Time elapsed: 0.005 s
% 0.13/0.38 % (30245)Instructions burned: 3 (million)
% 0.13/0.38 % (30245)------------------------------
% 0.13/0.38 % (30245)------------------------------
% 0.13/0.38 % (30239)Success in time 0.007 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------