TSTP Solution File: SEV134^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV134^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 : n028.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:12:06 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 87 ( 37 equ; 0 cnn)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 125 ( 22 ~; 12 |; 16 &; 62 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 ^ 32 !; 12 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > a > $o ).
thf(f14,plain,
$false,
inference(subsumption_resolution,[],[f12,f11]) ).
thf(f11,plain,
( $true
!= ( sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X3: a,X4: a] :
( ( ( sK2 @ X4 @ X3 )
!= $true )
| ( $true
= ( sK1 @ X3 ) )
| ( $true
!= ( sK1 @ X4 ) ) )
& ( $true
= ( sK1 @ sK0 ) )
& ( $true
!= ( sK1 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a,X1: a > $o,X2: a > a > $o] :
( ! [X3: a,X4: a] :
( ( ( X2 @ X4 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true )
| ( ( X1 @ X4 )
!= $true ) )
& ( $true
= ( X1 @ X0 ) )
& ( $true
!= ( X1 @ X0 ) ) )
=> ( ! [X4: a,X3: a] :
( ( ( sK2 @ X4 @ X3 )
!= $true )
| ( $true
= ( sK1 @ X3 ) )
| ( $true
!= ( sK1 @ X4 ) ) )
& ( $true
= ( sK1 @ sK0 ) )
& ( $true
!= ( sK1 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a,X1: a > $o,X2: a > a > $o] :
( ! [X3: a,X4: a] :
( ( ( X2 @ X4 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true )
| ( ( X1 @ X4 )
!= $true ) )
& ( $true
= ( X1 @ X0 ) )
& ( $true
!= ( X1 @ X0 ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X2: a,X1: a > $o,X0: a > a > $o] :
( ! [X4: a,X3: a] :
( ( ( X0 @ X3 @ X4 )
!= $true )
| ( ( X1 @ X4 )
= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ( $true
= ( X1 @ X2 ) )
& ( $true
!= ( X1 @ X2 ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: a > a > $o,X2: a,X1: a > $o] :
( ( $true
!= ( X1 @ X2 ) )
& ( $true
= ( X1 @ X2 ) )
& ! [X4: a,X3: a] :
( ( ( X1 @ X4 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X3 @ X4 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o,X2: a,X1: a > $o] :
( ! [X4: a,X3: a] :
( ( ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 @ X4 )
= $true ) )
=> ( ( X1 @ X4 )
= $true ) )
=> ( ( $true
= ( X1 @ X2 ) )
=> ( $true
= ( X1 @ X2 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o,X1: a > $o,X2: a] :
( ! [X3: a,X4: a] :
( ( ( X1 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X1 @ X4 ) )
=> ( ( X1 @ X2 )
=> ( X1 @ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o,X2: a > $o,X1: a] :
( ! [X3: a,X4: a] :
( ( ( X2 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X2 @ X4 ) )
=> ( ( X2 @ X1 )
=> ( X2 @ X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o,X2: a > $o,X1: a] :
( ! [X3: a,X4: a] :
( ( ( X2 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X2 @ X4 ) )
=> ( ( X2 @ X1 )
=> ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM201_pme) ).
thf(f12,plain,
( $true
= ( sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEV134^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.12 % 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.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Sun May 19 18:49:52 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.15/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.31 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.15/0.33 % (4013)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.15/0.33 % (4015)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.33 % (4009)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.15/0.33 % (4013)Instruction limit reached!
% 0.15/0.33 % (4013)------------------------------
% 0.15/0.33 % (4013)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (4013)Termination reason: Unknown
% 0.15/0.33 % (4013)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (4013)Memory used [KB]: 5500
% 0.15/0.33 % (4013)Time elapsed: 0.003 s
% 0.15/0.33 % (4013)Instructions burned: 2 (million)
% 0.15/0.33 % (4013)------------------------------
% 0.15/0.33 % (4013)------------------------------
% 0.15/0.33 % (4015)First to succeed.
% 0.15/0.33 % (4010)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.15/0.33 % (4016)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.15/0.33 % (4009)Also succeeded, but the first one will report.
% 0.15/0.33 % (4015)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33 % (4015)------------------------------
% 0.15/0.33 % (4015)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (4015)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (4015)Memory used [KB]: 5500
% 0.15/0.33 % (4015)Time elapsed: 0.003 s
% 0.15/0.33 % (4015)Instructions burned: 1 (million)
% 0.15/0.33 % (4015)------------------------------
% 0.15/0.33 % (4015)------------------------------
% 0.15/0.33 % (4008)Success in time 0.012 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------