TSTP Solution File: ALG298^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG298^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 : n027.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 : Mon May 20 18:20:53 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of formulae : 40 ( 14 unt; 16 typ; 0 def)
% Number of atoms : 63 ( 62 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 375 ( 12 ~; 0 |; 33 &; 324 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 123 ( 0 ^ 89 !; 33 ?; 123 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
c: $tType ).
thf(type_def_7,type,
b: $tType ).
thf(type_def_8,type,
a: $tType ).
thf(func_def_0,type,
c: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
a: $tType ).
thf(func_def_3,type,
c_starc: c > c > c ).
thf(func_def_4,type,
c_starb: b > b > b ).
thf(func_def_5,type,
c_stara: a > a > a ).
thf(func_def_7,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_10,type,
sK0: b > c ).
thf(func_def_11,type,
sK1: a > c ).
thf(func_def_12,type,
sK2: a > b ).
thf(func_def_13,type,
sK3: b > a ).
thf(func_def_14,type,
sK4: b ).
thf(func_def_15,type,
sK5: b ).
thf(f56,plain,
$false,
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( sK0 @ ( c_starb @ sK5 @ sK4 ) )
!= ( sK0 @ ( c_starb @ sK5 @ sK4 ) ) ),
inference(superposition,[],[f13,f46]) ).
thf(f46,plain,
! [X0: b,X1: b] :
( ( sK0 @ ( c_starb @ X0 @ X1 ) )
= ( c_starc @ ( sK0 @ X0 ) @ ( sK0 @ X1 ) ) ),
inference(forward_demodulation,[],[f42,f17]) ).
thf(f17,plain,
! [X0: b] :
( ( sK0 @ X0 )
= ( sK1 @ ( sK3 @ X0 ) ) ),
inference(superposition,[],[f12,f14]) ).
thf(f14,plain,
! [X7: b] :
( ( sK2 @ ( sK3 @ X7 ) )
= X7 ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X3: a,X4: a] :
( ( sK1 @ ( c_stara @ X4 @ X3 ) )
= ( c_starc @ ( sK1 @ X4 ) @ ( sK1 @ X3 ) ) )
& ! [X5: a,X6: a] :
( ( sK2 @ ( c_stara @ X6 @ X5 ) )
= ( c_starb @ ( sK2 @ X6 ) @ ( sK2 @ X5 ) ) )
& ! [X7: b] :
( ( sK2 @ ( sK3 @ X7 ) )
= X7 )
& ( ( sK0 @ ( c_starb @ sK5 @ sK4 ) )
!= ( c_starc @ ( sK0 @ sK5 ) @ ( sK0 @ sK4 ) ) )
& ! [X11: a] :
( ( sK1 @ X11 )
= ( sK0 @ ( sK2 @ X11 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f7,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: b > c,X1: a > c,X2: a > b] :
( ! [X3: a,X4: a] :
( ( X1 @ ( c_stara @ X4 @ X3 ) )
= ( c_starc @ ( X1 @ X4 ) @ ( X1 @ X3 ) ) )
& ! [X5: a,X6: a] :
( ( X2 @ ( c_stara @ X6 @ X5 ) )
= ( c_starb @ ( X2 @ X6 ) @ ( X2 @ X5 ) ) )
& ! [X7: b] :
? [X8: a] :
( ( X2 @ X8 )
= X7 )
& ? [X9: b,X10: b] :
( ( X0 @ ( c_starb @ X10 @ X9 ) )
!= ( c_starc @ ( X0 @ X10 ) @ ( X0 @ X9 ) ) )
& ! [X11: a] :
( ( X1 @ X11 )
= ( X0 @ ( X2 @ X11 ) ) ) )
=> ( ! [X4: a,X3: a] :
( ( sK1 @ ( c_stara @ X4 @ X3 ) )
= ( c_starc @ ( sK1 @ X4 ) @ ( sK1 @ X3 ) ) )
& ! [X6: a,X5: a] :
( ( sK2 @ ( c_stara @ X6 @ X5 ) )
= ( c_starb @ ( sK2 @ X6 ) @ ( sK2 @ X5 ) ) )
& ! [X7: b] :
? [X8: a] :
( ( sK2 @ X8 )
= X7 )
& ? [X10: b,X9: b] :
( ( c_starc @ ( sK0 @ X10 ) @ ( sK0 @ X9 ) )
!= ( sK0 @ ( c_starb @ X10 @ X9 ) ) )
& ! [X11: a] :
( ( sK1 @ X11 )
= ( sK0 @ ( sK2 @ X11 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X7: b] :
( ? [X8: a] :
( ( sK2 @ X8 )
= X7 )
=> ( ( sK2 @ ( sK3 @ X7 ) )
= X7 ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X10: b,X9: b] :
( ( c_starc @ ( sK0 @ X10 ) @ ( sK0 @ X9 ) )
!= ( sK0 @ ( c_starb @ X10 @ X9 ) ) )
=> ( ( sK0 @ ( c_starb @ sK5 @ sK4 ) )
!= ( c_starc @ ( sK0 @ sK5 ) @ ( sK0 @ sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: b > c,X1: a > c,X2: a > b] :
( ! [X3: a,X4: a] :
( ( X1 @ ( c_stara @ X4 @ X3 ) )
= ( c_starc @ ( X1 @ X4 ) @ ( X1 @ X3 ) ) )
& ! [X5: a,X6: a] :
( ( X2 @ ( c_stara @ X6 @ X5 ) )
= ( c_starb @ ( X2 @ X6 ) @ ( X2 @ X5 ) ) )
& ! [X7: b] :
? [X8: a] :
( ( X2 @ X8 )
= X7 )
& ? [X9: b,X10: b] :
( ( X0 @ ( c_starb @ X10 @ X9 ) )
!= ( c_starc @ ( X0 @ X10 ) @ ( X0 @ X9 ) ) )
& ! [X11: a] :
( ( X1 @ X11 )
= ( X0 @ ( X2 @ X11 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X0: b > c,X1: a > c,X2: a > b] :
( ! [X8: a,X7: a] :
( ( X1 @ ( c_stara @ X7 @ X8 ) )
= ( c_starc @ ( X1 @ X7 ) @ ( X1 @ X8 ) ) )
& ! [X4: a,X3: a] :
( ( X2 @ ( c_stara @ X3 @ X4 ) )
= ( c_starb @ ( X2 @ X3 ) @ ( X2 @ X4 ) ) )
& ! [X5: b] :
? [X6: a] :
( ( X2 @ X6 )
= X5 )
& ? [X10: b,X11: b] :
( ( c_starc @ ( X0 @ X11 ) @ ( X0 @ X10 ) )
!= ( X0 @ ( c_starb @ X11 @ X10 ) ) )
& ! [X9: a] :
( ( X1 @ X9 )
= ( X0 @ ( X2 @ X9 ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
? [X1: a > c,X2: a > b,X0: b > c] :
( ? [X10: b,X11: b] :
( ( c_starc @ ( X0 @ X11 ) @ ( X0 @ X10 ) )
!= ( X0 @ ( c_starb @ X11 @ X10 ) ) )
& ! [X5: b] :
? [X6: a] :
( ( X2 @ X6 )
= X5 )
& ! [X4: a,X3: a] :
( ( X2 @ ( c_stara @ X3 @ X4 ) )
= ( c_starb @ ( X2 @ X3 ) @ ( X2 @ X4 ) ) )
& ! [X9: a] :
( ( X1 @ X9 )
= ( X0 @ ( X2 @ X9 ) ) )
& ! [X8: a,X7: a] :
( ( X1 @ ( c_stara @ X7 @ X8 ) )
= ( c_starc @ ( X1 @ X7 ) @ ( X1 @ X8 ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f4,plain,
~ ! [X1: a > c,X2: a > b,X0: b > c] :
( ( ! [X5: b] :
? [X6: a] :
( ( X2 @ X6 )
= X5 )
& ! [X4: a,X3: a] :
( ( X2 @ ( c_stara @ X3 @ X4 ) )
= ( c_starb @ ( X2 @ X3 ) @ ( X2 @ X4 ) ) )
& ! [X9: a] :
( ( X1 @ X9 )
= ( X0 @ ( X2 @ X9 ) ) )
& ! [X8: a,X7: a] :
( ( X1 @ ( c_stara @ X7 @ X8 ) )
= ( c_starc @ ( X1 @ X7 ) @ ( X1 @ X8 ) ) ) )
=> ! [X10: b,X11: b] :
( ( c_starc @ ( X0 @ X11 ) @ ( X0 @ X10 ) )
= ( X0 @ ( c_starb @ X11 @ X10 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: b > c,X1: a > c,X0: a > b] :
( ( ! [X3: a,X4: a] :
( ( X0 @ ( c_stara @ X3 @ X4 ) )
= ( c_starb @ ( X0 @ X3 ) @ ( X0 @ X4 ) ) )
& ! [X4: b] :
? [X3: a] :
( ( X0 @ X3 )
= X4 )
& ! [X3: a,X4: a] :
( ( X1 @ ( c_stara @ X3 @ X4 ) )
= ( c_starc @ ( X1 @ X3 ) @ ( X1 @ X4 ) ) )
& ! [X3: a] :
( ( X2 @ ( X0 @ X3 ) )
= ( X1 @ X3 ) ) )
=> ! [X4: b,X3: b] :
( ( X2 @ ( c_starb @ X3 @ X4 ) )
= ( c_starc @ ( X2 @ X3 ) @ ( X2 @ X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X2: b > c,X1: a > c,X0: a > b] :
( ( ! [X3: a,X4: a] :
( ( X0 @ ( c_stara @ X3 @ X4 ) )
= ( c_starb @ ( X0 @ X3 ) @ ( X0 @ X4 ) ) )
& ! [X4: b] :
? [X3: a] :
( ( X0 @ X3 )
= X4 )
& ! [X3: a,X4: a] :
( ( X1 @ ( c_stara @ X3 @ X4 ) )
= ( c_starc @ ( X1 @ X3 ) @ ( X1 @ X4 ) ) )
& ! [X3: a] :
( ( X2 @ ( X0 @ X3 ) )
= ( X1 @ X3 ) ) )
=> ! [X4: b,X3: b] :
( ( X2 @ ( c_starb @ X3 @ X4 ) )
= ( c_starc @ ( X2 @ X3 ) @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM270_pme) ).
thf(f12,plain,
! [X11: a] :
( ( sK1 @ X11 )
= ( sK0 @ ( sK2 @ X11 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f42,plain,
! [X0: b,X1: b] :
( ( c_starc @ ( sK1 @ ( sK3 @ X0 ) ) @ ( sK0 @ X1 ) )
= ( sK0 @ ( c_starb @ X0 @ X1 ) ) ),
inference(superposition,[],[f40,f14]) ).
thf(f40,plain,
! [X0: a,X1: b] :
( ( sK0 @ ( c_starb @ ( sK2 @ X0 ) @ X1 ) )
= ( c_starc @ ( sK1 @ X0 ) @ ( sK0 @ X1 ) ) ),
inference(forward_demodulation,[],[f24,f20]) ).
thf(f20,plain,
! [X0: b,X1: a] :
( ( c_starc @ ( sK1 @ X1 ) @ ( sK0 @ X0 ) )
= ( sK1 @ ( c_stara @ X1 @ ( sK3 @ X0 ) ) ) ),
inference(superposition,[],[f16,f17]) ).
thf(f16,plain,
! [X3: a,X4: a] :
( ( sK1 @ ( c_stara @ X4 @ X3 ) )
= ( c_starc @ ( sK1 @ X4 ) @ ( sK1 @ X3 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f24,plain,
! [X0: a,X1: b] :
( ( sK0 @ ( c_starb @ ( sK2 @ X0 ) @ X1 ) )
= ( sK1 @ ( c_stara @ X0 @ ( sK3 @ X1 ) ) ) ),
inference(superposition,[],[f12,f18]) ).
thf(f18,plain,
! [X0: b,X1: a] :
( ( sK2 @ ( c_stara @ X1 @ ( sK3 @ X0 ) ) )
= ( c_starb @ ( sK2 @ X1 ) @ X0 ) ),
inference(superposition,[],[f15,f14]) ).
thf(f15,plain,
! [X6: a,X5: a] :
( ( sK2 @ ( c_stara @ X6 @ X5 ) )
= ( c_starb @ ( sK2 @ X6 ) @ ( sK2 @ X5 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f13,plain,
( ( sK0 @ ( c_starb @ sK5 @ sK4 ) )
!= ( c_starc @ ( sK0 @ sK5 ) @ ( sK0 @ sK4 ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG298^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 23:38:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (26022)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.37 % (26023)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 (2999ds/4Mi)
% 0.14/0.37 % (26024)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 (2999ds/27Mi)
% 0.14/0.37 % (26025)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (26026)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 (2999ds/2Mi)
% 0.14/0.37 % (26027)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 (2999ds/275Mi)
% 0.14/0.37 % (26028)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (26029)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.37 % (26026)Instruction limit reached!
% 0.14/0.37 % (26026)------------------------------
% 0.14/0.37 % (26026)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26026)Termination reason: Unknown
% 0.14/0.37 % (26026)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (26026)Memory used [KB]: 895
% 0.14/0.37 % (26026)Time elapsed: 0.003 s
% 0.14/0.37 % (26026)Instructions burned: 2 (million)
% 0.14/0.37 % (26026)------------------------------
% 0.14/0.37 % (26026)------------------------------
% 0.14/0.37 % (26025)Instruction limit reached!
% 0.14/0.37 % (26025)------------------------------
% 0.14/0.37 % (26025)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26025)Termination reason: Unknown
% 0.14/0.37 % (26025)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26025)Memory used [KB]: 5500
% 0.14/0.37 % (26025)Time elapsed: 0.004 s
% 0.14/0.37 % (26025)Instructions burned: 2 (million)
% 0.14/0.37 % (26025)------------------------------
% 0.14/0.37 % (26025)------------------------------
% 0.14/0.37 % (26029)Instruction limit reached!
% 0.14/0.37 % (26029)------------------------------
% 0.14/0.37 % (26029)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26029)Termination reason: Unknown
% 0.14/0.37 % (26029)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26029)Memory used [KB]: 5500
% 0.14/0.37 % (26029)Time elapsed: 0.005 s
% 0.14/0.37 % (26029)Instructions burned: 3 (million)
% 0.14/0.37 % (26029)------------------------------
% 0.14/0.37 % (26029)------------------------------
% 0.14/0.37 % (26023)Instruction limit reached!
% 0.14/0.37 % (26023)------------------------------
% 0.14/0.37 % (26023)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26023)Termination reason: Unknown
% 0.14/0.37 % (26023)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26023)Memory used [KB]: 5500
% 0.14/0.37 % (26023)Time elapsed: 0.006 s
% 0.14/0.37 % (26023)Instructions burned: 5 (million)
% 0.14/0.37 % (26023)------------------------------
% 0.14/0.37 % (26023)------------------------------
% 0.14/0.38 % (26024)First to succeed.
% 0.14/0.38 % (26028)Also succeeded, but the first one will report.
% 0.14/0.38 % (26024)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 % (26024)------------------------------
% 0.14/0.38 % (26024)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26024)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (26024)Memory used [KB]: 5628
% 0.14/0.38 % (26024)Time elapsed: 0.013 s
% 0.14/0.38 % (26024)Instructions burned: 13 (million)
% 0.14/0.38 % (26024)------------------------------
% 0.14/0.38 % (26024)------------------------------
% 0.14/0.38 % (26021)Success in time 0.014 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------