TSTP Solution File: SET183^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET183^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 : n011.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:09:32 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 116 ( 42 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 116 ( 16 ~; 13 |; 17 &; 61 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 10 ^ 17 !; 4 ?; 32 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_10,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
sK4: a ).
thf(f25,plain,
$false,
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
$true = $false,
inference(forward_demodulation,[],[f23,f21]) ).
thf(f21,plain,
( $false
= ( sK0 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f16,f19]) ).
thf(f19,plain,
( $true
= ( sK1 @ sK4 ) ),
inference(duplicate_literal_removal,[],[f17]) ).
thf(f17,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
!= ( sK1 @ sK4 ) ),
inference(beta_eta_normalization,[],[f11]) ).
thf(f11,plain,
( ( sK1 @ sK4 )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f10,plain,
( sK1
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( sK1
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
& ! [X2: a] :
( ( ( sK0 @ X2 )
= $true )
| ( ( sK1 @ X2 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
!= X1 )
& ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) ) )
=> ( ( sK1
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
& ! [X2: a] :
( ( ( sK0 @ X2 )
= $true )
| ( ( sK1 @ X2 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
!= X1 )
& ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
=> ( ( X0 @ X2 )
= $true ) )
=> ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) )
=> ( ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) ) )
= X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= X0 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_42_pme) ).
thf(f16,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(duplicate_literal_removal,[],[f15]) ).
thf(f15,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) )
= $false )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f23,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true != $true ) ),
inference(superposition,[],[f9,f19]) ).
thf(f9,plain,
! [X2: a] :
( ( ( sK1 @ X2 )
!= $true )
| ( ( sK0 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET183^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.14/0.35 % Computer : n011.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 13:32: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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (21680)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.14/0.37 % (21679)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (21678)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.37 % (21681)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.14/0.37 % (21682)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 % (21676)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 % (21679)Instruction limit reached!
% 0.14/0.37 % (21679)------------------------------
% 0.14/0.37 % (21679)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (21679)Termination reason: Unknown
% 0.14/0.37 % (21680)Instruction limit reached!
% 0.14/0.37 % (21680)------------------------------
% 0.14/0.37 % (21680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (21679)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (21679)Memory used [KB]: 5500
% 0.14/0.37 % (21679)Time elapsed: 0.004 s
% 0.14/0.37 % (21679)Instructions burned: 2 (million)
% 0.14/0.37 % (21679)------------------------------
% 0.14/0.37 % (21679)------------------------------
% 0.14/0.37 % (21680)Termination reason: Unknown
% 0.14/0.37 % (21680)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (21680)Memory used [KB]: 5500
% 0.14/0.37 % (21680)Time elapsed: 0.004 s
% 0.14/0.37 % (21680)Instructions burned: 2 (million)
% 0.14/0.37 % (21680)------------------------------
% 0.14/0.37 % (21680)------------------------------
% 0.14/0.37 % (21683)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 % (21682)First to succeed.
% 0.14/0.37 % (21683)Refutation not found, incomplete strategy
% 0.14/0.37 % (21683)------------------------------
% 0.14/0.37 % (21683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (21683)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (21683)Memory used [KB]: 5500
% 0.14/0.37 % (21683)Time elapsed: 0.003 s
% 0.14/0.37 % (21683)Instructions burned: 1 (million)
% 0.14/0.37 % (21683)------------------------------
% 0.14/0.37 % (21683)------------------------------
% 0.14/0.37 % (21678)Also succeeded, but the first one will report.
% 0.14/0.37 % (21682)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 % (21682)------------------------------
% 0.14/0.37 % (21682)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (21682)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (21682)Memory used [KB]: 5500
% 0.14/0.37 % (21682)Time elapsed: 0.004 s
% 0.14/0.37 % (21682)Instructions burned: 2 (million)
% 0.14/0.37 % (21682)------------------------------
% 0.14/0.37 % (21682)------------------------------
% 0.14/0.37 % (21675)Success in time 0.006 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------