TSTP Solution File: SEV076^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV076^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 : n019.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:54 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 204 ( 87 equ; 0 cnn)
% Maximal formula atoms : 20 ( 12 avg)
% Number of connectives : 373 ( 42 ~; 25 |; 48 &; 230 @)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 63 ( 63 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 129 ( 1 ^ 95 !; 32 ?; 129 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: ( a > $o ) > a ).
thf(func_def_5,type,
sK1: a > a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a > a ).
thf(func_def_8,type,
sK4: a > ( a > $o ) > a ).
thf(func_def_11,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f38,plain,
$false,
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
$true != $true,
inference(superposition,[],[f18,f25]) ).
thf(f25,plain,
! [X0: a] :
( ( sK1 @ X0
@ ( sK0
@ ^ [Y0: a] : $true ) )
= $true ),
inference(equality_resolution,[],[f15]) ).
thf(f15,plain,
! [X8: a,X5: a > $o] :
( ( ( X5 @ X8 )
!= $true )
| ( ( sK1 @ X8 @ ( sK0 @ X5 ) )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ! [X3: a] :
( ( ( sK2 @ ( sK3 @ X3 ) )
= $true )
& ( ( sK1 @ ( sK3 @ X3 ) @ X3 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( sK1 @ ( sK0 @ X5 ) @ X6 )
= $true )
| ( ( ( sK1 @ ( sK4 @ X6 @ X5 ) @ X6 )
!= $true )
& ( ( X5 @ ( sK4 @ X6 @ X5 ) )
= $true ) ) )
& ! [X8: a] :
( ( ( sK1 @ X8 @ ( sK0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) )
& ! [X9: a,X10: a,X11: a] :
( ( ( sK1 @ X10 @ X9 )
= $true )
| ( ( sK1 @ X10 @ X11 )
!= $true )
| ( ( sK1 @ X11 @ X9 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( a > $o ) > a,X1: a > a > $o] :
( ? [X2: a > $o] :
! [X3: a] :
? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( ( X1 @ X4 @ X3 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X6 )
= $true )
| ? [X7: a] :
( ( ( X1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) ) )
& ! [X8: a] :
( ( ( X1 @ X8 @ ( X0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) )
& ! [X9: a,X10: a,X11: a] :
( ( ( X1 @ X10 @ X9 )
= $true )
| ( ( X1 @ X10 @ X11 )
!= $true )
| ( ( X1 @ X11 @ X9 )
!= $true ) ) )
=> ( ? [X2: a > $o] :
! [X3: a] :
? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( ( sK1 @ X4 @ X3 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( sK1 @ ( sK0 @ X5 ) @ X6 )
= $true )
| ? [X7: a] :
( ( ( sK1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) ) )
& ! [X8: a] :
( ( ( sK1 @ X8 @ ( sK0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) )
& ! [X11: a,X10: a,X9: a] :
( ( ( sK1 @ X10 @ X9 )
= $true )
| ( ( sK1 @ X10 @ X11 )
!= $true )
| ( ( sK1 @ X11 @ X9 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X2: a > $o] :
! [X3: a] :
? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( ( sK1 @ X4 @ X3 )
!= $true ) )
=> ! [X3: a] :
? [X4: a] :
( ( ( sK2 @ X4 )
= $true )
& ( ( sK1 @ X4 @ X3 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X3: a] :
( ? [X4: a] :
( ( ( sK2 @ X4 )
= $true )
& ( ( sK1 @ X4 @ X3 )
!= $true ) )
=> ( ( ( sK2 @ ( sK3 @ X3 ) )
= $true )
& ( ( sK1 @ ( sK3 @ X3 ) @ X3 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X5: a > $o,X6: a] :
( ? [X7: a] :
( ( ( sK1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) )
=> ( ( ( sK1 @ ( sK4 @ X6 @ X5 ) @ X6 )
!= $true )
& ( ( X5 @ ( sK4 @ X6 @ X5 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( a > $o ) > a,X1: a > a > $o] :
( ? [X2: a > $o] :
! [X3: a] :
? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( ( X1 @ X4 @ X3 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X6 )
= $true )
| ? [X7: a] :
( ( ( X1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) ) )
& ! [X8: a] :
( ( ( X1 @ X8 @ ( X0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) )
& ! [X9: a,X10: a,X11: a] :
( ( ( X1 @ X10 @ X9 )
= $true )
| ( ( X1 @ X10 @ X11 )
!= $true )
| ( ( X1 @ X11 @ X9 )
!= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: ( a > $o ) > a,X1: a > a > $o] :
( ? [X9: a > $o] :
! [X10: a] :
? [X11: a] :
( ( ( X9 @ X11 )
= $true )
& ( ( X1 @ X11 @ X10 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X6 )
= $true )
| ? [X7: a] :
( ( ( X1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) ) )
& ! [X8: a] :
( ( ( X1 @ X8 @ ( X0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) )
& ! [X4: a,X2: a,X3: a] :
( ( ( X1 @ X2 @ X4 )
= $true )
| ( ( X1 @ X2 @ X3 )
!= $true )
| ( ( X1 @ X3 @ X4 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: ( a > $o ) > a,X1: a > a > $o] :
( ? [X9: a > $o] :
! [X10: a] :
? [X11: a] :
( ( ( X9 @ X11 )
= $true )
& ( ( X1 @ X11 @ X10 )
!= $true ) )
& ! [X4: a,X3: a,X2: a] :
( ( ( X1 @ X2 @ X4 )
= $true )
| ( ( X1 @ X3 @ X4 )
!= $true )
| ( ( X1 @ X2 @ X3 )
!= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X6 )
= $true )
| ? [X7: a] :
( ( ( X1 @ X7 @ X6 )
!= $true )
& ( ( X5 @ X7 )
= $true ) ) )
& ! [X8: a] :
( ( ( X1 @ X8 @ ( X0 @ X5 ) )
= $true )
| ( ( X5 @ X8 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( a > $o ) > a,X1: a > a > $o] :
( ( ! [X4: a,X3: a,X2: a] :
( ( ( ( X1 @ X3 @ X4 )
= $true )
& ( ( X1 @ X2 @ X3 )
= $true ) )
=> ( ( X1 @ X2 @ X4 )
= $true ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ! [X7: a] :
( ( ( X5 @ X7 )
= $true )
=> ( ( X1 @ X7 @ X6 )
= $true ) )
=> ( ( X1 @ ( X0 @ X5 ) @ X6 )
= $true ) )
& ! [X8: a] :
( ( ( X5 @ X8 )
= $true )
=> ( ( X1 @ X8 @ ( X0 @ X5 ) )
= $true ) ) ) )
=> ! [X9: a > $o] :
? [X10: a] :
! [X11: a] :
( ( ( X9 @ X11 )
= $true )
=> ( ( X1 @ X11 @ X10 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( a > $o ) > a,X1: a > a > $o] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( X1 @ X2 @ X3 )
& ( X1 @ X3 @ X4 ) )
=> ( X1 @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( X1 @ X7 @ X6 ) )
=> ( X1 @ ( X0 @ X5 ) @ X6 ) )
& ! [X8: a] :
( ( X5 @ X8 )
=> ( X1 @ X8 @ ( X0 @ X5 ) ) ) ) )
=> ! [X9: a > $o] :
? [X10: a] :
! [X11: a] :
( ( X9 @ X11 )
=> ( X1 @ X11 @ X10 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: ( a > $o ) > a,X0: a > a > $o] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X0 @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( X0 @ X7 @ X6 ) )
=> ( X0 @ ( X1 @ X5 ) @ X6 ) )
& ! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ ( X1 @ X5 ) ) ) ) )
=> ! [X5: a > $o] :
? [X8: a] :
! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ X8 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: ( a > $o ) > a,X0: a > a > $o] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X0 @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( X0 @ X7 @ X6 ) )
=> ( X0 @ ( X1 @ X5 ) @ X6 ) )
& ! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ ( X1 @ X5 ) ) ) ) )
=> ! [X5: a > $o] :
? [X8: a] :
! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM401B_pme) ).
thf(f18,plain,
! [X3: a] :
( ( sK1 @ ( sK3 @ X3 ) @ X3 )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV076^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % 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.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:12:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 % (6810)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.36 % (6809)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.37 % (6810)Instruction limit reached!
% 0.14/0.37 % (6810)------------------------------
% 0.14/0.37 % (6810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6810)Termination reason: Unknown
% 0.14/0.37 % (6810)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (6810)Memory used [KB]: 5500
% 0.14/0.37 % (6810)Time elapsed: 0.004 s
% 0.14/0.37 % (6810)Instructions burned: 4 (million)
% 0.14/0.37 % (6810)------------------------------
% 0.14/0.37 % (6810)------------------------------
% 0.14/0.37 % (6809)First to succeed.
% 0.14/0.37 % (6809)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (6809)------------------------------
% 0.14/0.37 % (6809)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6809)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (6809)Memory used [KB]: 5500
% 0.14/0.37 % (6809)Time elapsed: 0.006 s
% 0.14/0.37 % (6809)Instructions burned: 5 (million)
% 0.14/0.37 % (6809)------------------------------
% 0.14/0.37 % (6809)------------------------------
% 0.14/0.37 % (6802)Success in time 0.017 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------