TSTP Solution File: LCL726^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL726^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 : Tue May 21 00:22:23 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 25 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 106 ( 40 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 182 ( 17 ~; 8 |; 10 &; 120 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 124 ( 124 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 3 con; 0-2 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 75 ( 0 ^ 47 !; 26 ?; 75 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( ( a > $o ) > $o ) > a > $o ).
thf(func_def_6,type,
sK1: ( ( a > $o ) > $o ) > ( a > $o ) > a ).
thf(func_def_7,type,
sK2: ( ( a > $o ) > a ) > a > $o ).
thf(func_def_8,type,
sK3: ( ( a > $o ) > a ) > a ).
thf(func_def_10,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f28,plain,
$false,
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
$true = $false,
inference(superposition,[],[f13,f20]) ).
thf(f20,plain,
! [X0: a] :
( ( sK2 @ @@+ @ a @ X0 )
= $false ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
! [X0: a] :
( ( ( sK2 @ @@+ @ a @ X0 )
= $false )
| ( $true != $true ) ),
inference(superposition,[],[f12,f16]) ).
thf(f16,plain,
! [X0: ( a > $o ) > a,X1: a] :
( ( $true
= ( sK2 @ X0 @ ( @@+ @ a @ ( sK2 @ X0 ) ) ) )
| ( ( sK2 @ X0 @ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X8: ( a > $o ) > a] :
( $true
!= ( sK2 @ X8 @ ( X8 @ ( sK2 @ X8 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X0: ( a > $o ) > $o] :
( ( ! [X2: a] :
( $true
!= ( sK0 @ X0 @ X2 ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) ) ) )
| ! [X4: a > $o] :
( ( $true
!= ( X0 @ X4 ) )
| ( ( X4 @ ( sK1 @ X0 @ X4 ) )
= $true ) ) )
& ! [X6: ( a > $o ) > a] :
( $true
= ( sK2 @ X6 @ ( sK3 @ X6 ) ) )
& ! [X8: ( a > $o ) > a] :
( $true
!= ( sK2 @ X8 @ ( X8 @ ( sK2 @ X8 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f10,f9,f8,f7]) ).
thf(f7,plain,
! [X0: ( a > $o ) > $o] :
( ? [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X1 )
= $true ) )
=> ( ! [X2: a] :
( $true
!= ( sK0 @ X0 @ X2 ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
! [X0: ( a > $o ) > $o] :
( ? [X3: ( a > $o ) > a] :
! [X4: a > $o] :
( ( $true
!= ( X0 @ X4 ) )
| ( $true
= ( X4 @ ( X3 @ X4 ) ) ) )
=> ! [X4: a > $o] :
( ( $true
!= ( X0 @ X4 ) )
| ( ( X4 @ ( sK1 @ X0 @ X4 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X5: ( ( a > $o ) > a ) > a > $o] :
( ! [X6: ( a > $o ) > a] :
? [X7: a] :
( $true
= ( X5 @ X6 @ X7 ) )
& ! [X8: ( a > $o ) > a] :
( $true
!= ( X5 @ X8 @ ( X8 @ ( X5 @ X8 ) ) ) ) )
=> ( ! [X6: ( a > $o ) > a] :
? [X7: a] :
( $true
= ( sK2 @ X6 @ X7 ) )
& ! [X8: ( a > $o ) > a] :
( $true
!= ( sK2 @ X8 @ ( X8 @ ( sK2 @ X8 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X6: ( a > $o ) > a] :
( ? [X7: a] :
( $true
= ( sK2 @ X6 @ X7 ) )
=> ( $true
= ( sK2 @ X6 @ ( sK3 @ X6 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
( ! [X0: ( a > $o ) > $o] :
( ? [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X1 )
= $true ) )
| ? [X3: ( a > $o ) > a] :
! [X4: a > $o] :
( ( $true
!= ( X0 @ X4 ) )
| ( $true
= ( X4 @ ( X3 @ X4 ) ) ) ) )
& ? [X5: ( ( a > $o ) > a ) > a > $o] :
( ! [X6: ( a > $o ) > a] :
? [X7: a] :
( $true
= ( X5 @ X6 @ X7 ) )
& ! [X8: ( a > $o ) > a] :
( $true
!= ( X5 @ X8 @ ( X8 @ ( X5 @ X8 ) ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
=> ? [X2: a] :
( ( X1 @ X2 )
= $true ) )
=> ? [X3: ( a > $o ) > a] :
! [X4: a > $o] :
( ( $true
= ( X0 @ X4 ) )
=> ( $true
= ( X4 @ ( X3 @ X4 ) ) ) ) )
=> ! [X5: ( ( a > $o ) > a ) > a > $o] :
( ! [X6: ( a > $o ) > a] :
? [X7: a] :
( $true
= ( X5 @ X6 @ X7 ) )
=> ? [X8: ( a > $o ) > a] :
( $true
= ( X5 @ X8 @ ( X8 @ ( X5 @ X8 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ? [X2: a] : ( X1 @ X2 ) )
=> ? [X3: ( a > $o ) > a] :
! [X4: a > $o] :
( ( X0 @ X4 )
=> ( X4 @ ( X3 @ X4 ) ) ) )
=> ! [X5: ( ( a > $o ) > a ) > a > $o] :
( ! [X6: ( a > $o ) > a] :
? [X7: a] : ( X5 @ X6 @ X7 )
=> ? [X8: ( a > $o ) > a] : ( X5 @ X8 @ ( X8 @ ( X5 @ X8 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ? [X2: a] : ( X1 @ X2 ) )
=> ? [X3: ( a > $o ) > a] :
! [X1: a > $o] :
( ( X0 @ X1 )
=> ( X1 @ ( X3 @ X1 ) ) ) )
=> ! [X4: ( ( a > $o ) > a ) > a > $o] :
( ! [X5: ( a > $o ) > a] :
? [X6: a] : ( X4 @ X5 @ X6 )
=> ? [X3: ( a > $o ) > a] : ( X4 @ X3 @ ( X3 @ ( X4 @ X3 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ? [X2: a] : ( X1 @ X2 ) )
=> ? [X3: ( a > $o ) > a] :
! [X1: a > $o] :
( ( X0 @ X1 )
=> ( X1 @ ( X3 @ X1 ) ) ) )
=> ! [X4: ( ( a > $o ) > a ) > a > $o] :
( ! [X5: ( a > $o ) > a] :
? [X6: a] : ( X4 @ X5 @ X6 )
=> ? [X3: ( a > $o ) > a] : ( X4 @ X3 @ ( X3 @ ( X4 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM534) ).
thf(f13,plain,
! [X6: ( a > $o ) > a] :
( $true
= ( sK2 @ X6 @ ( sK3 @ X6 ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL726^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/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 : Mon May 20 00:45:37 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (21411)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.14/0.37 % (21418)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.37 % (21418)Instruction limit reached!
% 0.14/0.37 % (21418)------------------------------
% 0.14/0.37 % (21418)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (21418)Termination reason: Unknown
% 0.14/0.37 % (21418)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (21418)Memory used [KB]: 5500
% 0.14/0.37 % (21418)Time elapsed: 0.004 s
% 0.14/0.37 % (21418)Instructions burned: 4 (million)
% 0.14/0.37 % (21418)------------------------------
% 0.14/0.37 % (21418)------------------------------
% 0.14/0.38 % (21412)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.14/0.38 % (21413)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.14/0.38 % (21412)Instruction limit reached!
% 0.14/0.38 % (21412)------------------------------
% 0.14/0.38 % (21412)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (21412)Termination reason: Unknown
% 0.14/0.38 % (21412)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (21412)Memory used [KB]: 5500
% 0.14/0.38 % (21412)Time elapsed: 0.005 s
% 0.14/0.38 % (21412)Instructions burned: 4 (million)
% 0.14/0.38 % (21412)------------------------------
% 0.14/0.38 % (21412)------------------------------
% 0.14/0.38 % (21414)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (21413)First to succeed.
% 0.14/0.38 % (21414)Instruction limit reached!
% 0.14/0.38 % (21414)------------------------------
% 0.14/0.38 % (21414)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (21414)Termination reason: Unknown
% 0.14/0.38 % (21414)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (21414)Memory used [KB]: 5500
% 0.14/0.38 % (21414)Time elapsed: 0.003 s
% 0.14/0.38 % (21414)Instructions burned: 2 (million)
% 0.14/0.38 % (21414)------------------------------
% 0.14/0.38 % (21414)------------------------------
% 0.14/0.38 % (21413)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 % (21413)------------------------------
% 0.14/0.38 % (21413)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (21413)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (21413)Memory used [KB]: 5500
% 0.14/0.38 % (21413)Time elapsed: 0.006 s
% 0.14/0.38 % (21413)Instructions burned: 4 (million)
% 0.14/0.38 % (21413)------------------------------
% 0.14/0.38 % (21413)------------------------------
% 0.14/0.38 % (21410)Success in time 0.023 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------