TSTP Solution File: SYO025^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO025^1 : TPTP v8.2.0. Released v3.7.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 : n008.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 09:02:16 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 15 unt; 1 typ; 0 def)
% Number of atoms : 185 ( 58 equ; 8 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 126 ( 66 ~; 44 |; 12 &; 4 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 16 ^ 0 !; 0 ?; 17 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_10,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f39,plain,
$false,
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
$false = $true,
inference(superposition,[],[f36,f34]) ).
thf(f34,plain,
sK3 = $true,
inference(duplicate_literal_removal,[],[f33]) ).
thf(f33,plain,
( ( sK3 = $true )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( sK3 = $true )
| ( $false = ~ sK3 ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( sK3 = $true )
| ( $false
= ( ~ sK2
| ~ sK3 ) ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( sK3 = $true )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( sK2
& sK3 )
= $true )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( sK2
& sK3 )
!= ( ~ ( ~ sK2
| ~ sK3 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( sK2
& sK3 )
!= ( ^ [Y0: $o] :
~ ( ~ sK2
| ~ Y0 )
@ sK3 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( (&) @ sK2 )
!= ( ^ [Y0: $o] :
~ ( ~ sK2
| ~ Y0 ) ) ),
inference(beta_eta_normalization,[],[f8]) ).
thf(f8,plain,
( ( (&) @ sK2 )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 )
@ sK2 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f7,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
!= (&) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
!= (&) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
= (&) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f36,plain,
sK3 = $false,
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $false = $true )
| ( sK3 = $false ) ),
inference(forward_demodulation,[],[f20,f27]) ).
thf(f27,plain,
$true = sK2,
inference(duplicate_literal_removal,[],[f26]) ).
thf(f26,plain,
( ( $true = sK2 )
| ( $true = sK2 ) ),
inference(not_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( $false = ~ sK2 )
| ( $true = sK2 ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( $true = sK2 )
| ( $false
= ( ~ sK2
| ~ sK3 ) ) ),
inference(not_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true )
| ( $true = sK2 ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f20,plain,
( ( $false = sK2 )
| ( sK3 = $false ) ),
inference(duplicate_literal_removal,[],[f19]) ).
thf(f19,plain,
( ( sK3 = $false )
| ( $false = sK2 )
| ( $false = sK2 ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( $false = sK2 )
| ( $true = ~ sK2 )
| ( sK3 = $false ) ),
inference(duplicate_literal_removal,[],[f17]) ).
thf(f17,plain,
( ( sK3 = $false )
| ( $true = ~ sK2 )
| ( sK3 = $false )
| ( $false = sK2 ) ),
inference(not_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( $true = ~ sK3 )
| ( sK3 = $false )
| ( $true = ~ sK2 )
| ( $false = sK2 ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( $false = sK2 )
| ( $true
= ( ~ sK2
| ~ sK3 ) )
| ( sK3 = $false ) ),
inference(not_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( sK3 = $false )
| ( $false = sK2 )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( sK2
& sK3 )
= $false )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO025^1 : TPTP v8.2.0. Released v3.7.0.
% 0.14/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.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:00:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.36 This is a TH0_THM_EQU_NAR problem
% 0.22/0.36 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.22/0.39 % (6194)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.22/0.39 % (6197)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 (2999ds/27Mi)
% 0.22/0.39 % (6196)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 (2999ds/4Mi)
% 0.22/0.39 % (6198)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39 % (6199)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 (2999ds/2Mi)
% 0.22/0.39 % (6201)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39 % (6200)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 (2999ds/275Mi)
% 0.22/0.39 % (6202)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.39 % (6198)Instruction limit reached!
% 0.22/0.39 % (6198)------------------------------
% 0.22/0.39 % (6198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (6198)Termination reason: Unknown
% 0.22/0.39 % (6199)Instruction limit reached!
% 0.22/0.39 % (6199)------------------------------
% 0.22/0.39 % (6199)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (6198)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (6198)Memory used [KB]: 5500
% 0.22/0.39 % (6198)Time elapsed: 0.005 s
% 0.22/0.39 % (6198)Instructions burned: 2 (million)
% 0.22/0.39 % (6198)------------------------------
% 0.22/0.39 % (6198)------------------------------
% 0.22/0.39 % (6199)Termination reason: Unknown
% 0.22/0.39 % (6199)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (6199)Memory used [KB]: 5500
% 0.22/0.39 % (6199)Time elapsed: 0.005 s
% 0.22/0.39 % (6199)Instructions burned: 2 (million)
% 0.22/0.39 % (6199)------------------------------
% 0.22/0.39 % (6199)------------------------------
% 0.22/0.39 % (6200)First to succeed.
% 0.22/0.39 % (6202)Refutation not found, incomplete strategy
% 0.22/0.39 % (6202)------------------------------
% 0.22/0.39 % (6202)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (6202)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.39
% 0.22/0.39
% 0.22/0.39 % (6202)Memory used [KB]: 5500
% 0.22/0.39 % (6202)Time elapsed: 0.005 s
% 0.22/0.39 % (6202)Instructions burned: 2 (million)
% 0.22/0.39 % (6202)------------------------------
% 0.22/0.39 % (6202)------------------------------
% 0.22/0.40 % (6201)Also succeeded, but the first one will report.
% 0.22/0.40 % (6200)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40 % (6200)------------------------------
% 0.22/0.40 % (6200)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (6200)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (6200)Memory used [KB]: 5500
% 0.22/0.40 % (6200)Time elapsed: 0.006 s
% 0.22/0.40 % (6200)Instructions burned: 2 (million)
% 0.22/0.40 % (6200)------------------------------
% 0.22/0.40 % (6200)------------------------------
% 0.22/0.40 % (6193)Success in time 0.018 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------