TSTP Solution File: SEU935^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU935^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 03:52:15 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 28 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 39 ( 38 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 13 ~; 0 |; 15 &; 55 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 0 ^ 42 !; 35 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_8,type,
c: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
c: $tType ).
thf(func_def_6,type,
sK0: a > b ).
thf(func_def_7,type,
sK1: b > c ).
thf(func_def_8,type,
sK2: c ).
thf(func_def_9,type,
sK3: c > b ).
thf(func_def_10,type,
sK4: b > a ).
thf(f18,plain,
$false,
inference(equality_resolution,[],[f17]) ).
thf(f17,plain,
! [X0: c] : ( sK2 != X0 ),
inference(superposition,[],[f16,f14]) ).
thf(f14,plain,
! [X4: c] :
( ( sK1 @ ( sK3 @ X4 ) )
= X4 ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X3: a] :
( sK2
!= ( sK1 @ ( sK0 @ X3 ) ) )
& ! [X4: c] :
( ( sK1 @ ( sK3 @ X4 ) )
= X4 )
& ! [X6: b] :
( ( sK0 @ ( sK4 @ X6 ) )
= X6 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f11,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: a > b,X1: b > c] :
( ? [X2: c] :
! [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
!= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X1 @ X5 )
= X4 )
& ! [X6: b] :
? [X7: a] :
( ( X0 @ X7 )
= X6 ) )
=> ( ? [X2: c] :
! [X3: a] :
( ( sK1 @ ( sK0 @ X3 ) )
!= X2 )
& ! [X4: c] :
? [X5: b] :
( ( sK1 @ X5 )
= X4 )
& ! [X6: b] :
? [X7: a] :
( ( sK0 @ X7 )
= X6 ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X2: c] :
! [X3: a] :
( ( sK1 @ ( sK0 @ X3 ) )
!= X2 )
=> ! [X3: a] :
( sK2
!= ( sK1 @ ( sK0 @ X3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X4: c] :
( ? [X5: b] :
( ( sK1 @ X5 )
= X4 )
=> ( ( sK1 @ ( sK3 @ X4 ) )
= X4 ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X6: b] :
( ? [X7: a] :
( ( sK0 @ X7 )
= X6 )
=> ( ( sK0 @ ( sK4 @ X6 ) )
= X6 ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a > b,X1: b > c] :
( ? [X2: c] :
! [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
!= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X1 @ X5 )
= X4 )
& ! [X6: b] :
? [X7: a] :
( ( X0 @ X7 )
= X6 ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X1: a > b,X0: b > c] :
( ? [X6: c] :
! [X7: a] :
( ( X0 @ ( X1 @ X7 ) )
!= X6 )
& ! [X2: c] :
? [X3: b] :
( ( X0 @ X3 )
= X2 )
& ! [X4: b] :
? [X5: a] :
( ( X1 @ X5 )
= X4 ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
? [X1: a > b,X0: b > c] :
( ? [X6: c] :
! [X7: a] :
( ( X0 @ ( X1 @ X7 ) )
!= X6 )
& ! [X2: c] :
? [X3: b] :
( ( X0 @ X3 )
= X2 )
& ! [X4: b] :
? [X5: a] :
( ( X1 @ X5 )
= X4 ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f4,plain,
~ ! [X1: a > b,X0: b > c] :
( ( ! [X2: c] :
? [X3: b] :
( ( X0 @ X3 )
= X2 )
& ! [X4: b] :
? [X5: a] :
( ( X1 @ X5 )
= X4 ) )
=> ! [X6: c] :
? [X7: a] :
( ( X0 @ ( X1 @ X7 ) )
= X6 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: b > c,X0: a > b] :
( ( ! [X2: c] :
? [X3: b] :
( ( X1 @ X3 )
= X2 )
& ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 ) )
=> ! [X2: c] :
? [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
= X2 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: b > c,X0: a > b] :
( ( ! [X2: c] :
? [X3: b] :
( ( X1 @ X3 )
= X2 )
& ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 ) )
=> ! [X2: c] :
? [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
= X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cFN_THM_2_pme) ).
thf(f16,plain,
! [X0: b] :
( ( sK1 @ X0 )
!= sK2 ),
inference(superposition,[],[f15,f13]) ).
thf(f13,plain,
! [X6: b] :
( ( sK0 @ ( sK4 @ X6 ) )
= X6 ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
! [X3: a] :
( sK2
!= ( sK1 @ ( sK0 @ X3 ) ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU935^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/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 16:31:38 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.19/0.37 % (15123)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.37 % (15122)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.19/0.37 % (15121)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.19/0.37 % (15125)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.19/0.37 % (15126)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.37 % (15127)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.19/0.37 % (15123)Instruction limit reached!
% 0.19/0.37 % (15123)------------------------------
% 0.19/0.37 % (15123)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (15123)Termination reason: Unknown
% 0.19/0.37 % (15123)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (15123)Memory used [KB]: 5500
% 0.19/0.37 % (15123)Time elapsed: 0.003 s
% 0.19/0.37 % (15123)Instructions burned: 2 (million)
% 0.19/0.37 % (15123)------------------------------
% 0.19/0.37 % (15123)------------------------------
% 0.19/0.37 % (15125)First to succeed.
% 0.19/0.37 % (15124)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.19/0.37 % (15126)Also succeeded, but the first one will report.
% 0.19/0.37 % (15124)Instruction limit reached!
% 0.19/0.37 % (15124)------------------------------
% 0.19/0.37 % (15124)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (15120)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.19/0.37 % (15124)Termination reason: Unknown
% 0.19/0.37 % (15124)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (15124)Memory used [KB]: 895
% 0.19/0.37 % (15124)Time elapsed: 0.003 s
% 0.19/0.37 % (15124)Instructions burned: 2 (million)
% 0.19/0.37 % (15124)------------------------------
% 0.19/0.37 % (15124)------------------------------
% 0.19/0.37 % (15125)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37 % (15125)------------------------------
% 0.19/0.37 % (15125)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (15125)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (15125)Memory used [KB]: 5500
% 0.19/0.37 % (15125)Time elapsed: 0.003 s
% 0.19/0.37 % (15125)Instructions burned: 2 (million)
% 0.19/0.37 % (15125)------------------------------
% 0.19/0.37 % (15125)------------------------------
% 0.19/0.37 % (15119)Success in time 0.014 s
% 0.19/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------