TSTP Solution File: SET612^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET612^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 : n005.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:12:25 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 16 unt; 7 typ; 0 def)
% Number of atoms : 332 ( 95 equ; 0 cnn)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 414 ( 81 ~; 73 |; 65 &; 194 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 22 ^ 12 !; 6 ?; 41 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_9,type,
sK0: a > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > $o ).
thf(func_def_13,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK5: a ).
thf(f58,plain,
$false,
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
$true = $false,
inference(superposition,[],[f31,f55]) ).
thf(f55,plain,
( ( sK2 @ sK5 )
= $false ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f54,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f53,f39]) ).
thf(f39,plain,
( $false
= ( sK0 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f38]) ).
thf(f38,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f36]) ).
thf(f36,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( ( ~ ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f35]) ).
thf(f35,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( $false
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( ( ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f26]) ).
thf(f26,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK2 @ sK5 )
& ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( sK2 @ sK5 )
& ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
!= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f11]) ).
thf(f11,plain,
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(boolean_simplification,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X2 @ Y0 )
& ~ ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ( sK2 @ Y0 )
& ~ ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X2 @ Y0 )
& ~ ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X2 @ Y0 )
& ~ ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X1 @ X3 )
| ( X0 @ X3 ) )
& ( X2 @ X3 ) ) )
= ( ^ [X4: a] :
( ~ ( X1 @ X4 )
& ~ ( X0 @ X4 )
& ( X2 @ X4 )
& ( X2 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X2 @ X3 )
| ( X1 @ X3 ) )
& ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ~ ( X2 @ X3 )
& ~ ( X1 @ X3 )
& ( X0 @ X3 )
& ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ^ [X3: a] :
( ~ ( ( X2 @ X3 )
| ( X1 @ X3 ) )
& ( X0 @ X3 ) ) )
= ( ^ [X3: a] :
( ~ ( X2 @ X3 )
& ~ ( X1 @ X3 )
& ( X0 @ X3 )
& ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_85_pme) ).
thf(f53,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
( ( $true = $false )
| ( $true
= ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(forward_demodulation,[],[f24,f51]) ).
thf(f51,plain,
( $false
= ( sK1 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f50]) ).
thf(f50,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f47]) ).
thf(f47,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( ( ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
( ( $false
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( ( ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( ( ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( ( ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f24,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f23]) ).
thf(f23,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( ~ ( sK0 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f21]) ).
thf(f21,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( $true
= ( sK0 @ sK5 ) )
| ( ( ~ ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f19]) ).
thf(f19,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( $true
= ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
| ( ( ~ ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( ( sK2 @ sK5 )
& ~ ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f31,plain,
( ( sK2 @ sK5 )
= $true ),
inference(duplicate_literal_removal,[],[f30]) ).
thf(f30,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ~ ( sK0 @ sK5 ) ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET612^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % 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.16/0.38 % Computer : n005.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 13:23:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.39 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.16/0.40 % (12310)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.16/0.40 % (12309)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.16/0.40 % (12311)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.16/0.40 % (12314)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.16/0.40 % (12312)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.40 % (12313)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.16/0.40 % (12315)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.40 % (12316)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.16/0.40 % (12312)Instruction limit reached!
% 0.16/0.40 % (12312)------------------------------
% 0.16/0.40 % (12312)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (12312)Termination reason: Unknown
% 0.16/0.40 % (12312)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (12313)Instruction limit reached!
% 0.16/0.40 % (12313)------------------------------
% 0.16/0.40 % (12313)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (12313)Termination reason: Unknown
% 0.16/0.40 % (12313)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (12313)Memory used [KB]: 5373
% 0.16/0.40 % (12313)Time elapsed: 0.003 s
% 0.16/0.40 % (12313)Instructions burned: 2 (million)
% 0.16/0.40 % (12313)------------------------------
% 0.16/0.40 % (12313)------------------------------
% 0.16/0.40 % (12312)Memory used [KB]: 5373
% 0.16/0.40 % (12312)Time elapsed: 0.003 s
% 0.16/0.40 % (12312)Instructions burned: 2 (million)
% 0.16/0.40 % (12312)------------------------------
% 0.16/0.40 % (12312)------------------------------
% 0.16/0.41 % (12314)First to succeed.
% 0.16/0.41 % (12316)Refutation not found, incomplete strategy
% 0.16/0.41 % (12316)------------------------------
% 0.16/0.41 % (12316)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (12316)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % (12316)Memory used [KB]: 5500
% 0.16/0.41 % (12316)Time elapsed: 0.003 s
% 0.16/0.41 % (12316)Instructions burned: 2 (million)
% 0.16/0.41 % (12316)------------------------------
% 0.16/0.41 % (12316)------------------------------
% 0.16/0.41 % (12310)Instruction limit reached!
% 0.16/0.41 % (12310)------------------------------
% 0.16/0.41 % (12310)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (12310)Termination reason: Unknown
% 0.16/0.41 % (12310)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (12310)Memory used [KB]: 5500
% 0.16/0.41 % (12310)Time elapsed: 0.005 s
% 0.16/0.41 % (12310)Instructions burned: 4 (million)
% 0.16/0.41 % (12310)------------------------------
% 0.16/0.41 % (12310)------------------------------
% 0.16/0.41 % (12309)Also succeeded, but the first one will report.
% 0.16/0.41 % (12314)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Theorem for theBenchmark
% 0.16/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.41 % (12314)------------------------------
% 0.16/0.41 % (12314)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (12314)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (12314)Memory used [KB]: 5500
% 0.16/0.41 % (12314)Time elapsed: 0.005 s
% 0.16/0.41 % (12314)Instructions burned: 2 (million)
% 0.16/0.41 % (12314)------------------------------
% 0.16/0.41 % (12314)------------------------------
% 0.16/0.41 % (12308)Success in time 0.005 s
% 0.16/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------