TSTP Solution File: PUZ083^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ083^1 : TPTP v8.2.0. Released v3.6.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 : n015.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 02:28:29 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 14 unt; 2 typ; 0 def)
% Number of atoms : 135 ( 31 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 122 ( 24 ~; 7 |; 0 &; 68 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 5 con; 0-2 aty)
% ( 6 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 22 ( 8 ^ 13 !; 0 ?; 22 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
says: $i > $o > $o ).
thf(func_def_11,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f40,plain,
$false,
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f37]) ).
thf(f37,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(superposition,[],[f18,f34]) ).
thf(f34,plain,
( ( says @ peter @ $true )
= $true ),
inference(forward_demodulation,[],[f32,f33]) ).
thf(f33,plain,
sK3 = $true,
inference(not_proxy_clausification,[],[f31]) ).
thf(f31,plain,
( $false = ~ sK3 ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( $false
= ( ( says @ peter @ sK3 )
=> ~ sK3 ) ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
( $false
= ( ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 )
@ sK3 ) ),
inference(sigma_clausification,[],[f28]) ).
thf(f28,plain,
( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
= $false ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
( ( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
= $false )
| ( $false = $true ) ),
inference(superposition,[],[f11,f18]) ).
thf(f11,plain,
( ( says @ peter
@ ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( says @ peter
@ ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
( says @ peter
@ ! [X0: $o] :
( ( says @ peter @ X0 )
=> ~ X0 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( says @ peter
@ ! [X0: $o] :
( ( says @ peter @ X0 )
=> ~ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(f32,plain,
( $true
= ( says @ peter @ sK3 ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f18,plain,
! [X1: $o] :
( ( $false
= ( says @ peter @ X1 ) )
| ( $false = X1 ) ),
inference(not_proxy_clausification,[],[f17]) ).
thf(f17,plain,
! [X1: $o] :
( ( ~ X1 = $true )
| ( $false
= ( says @ peter @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
! [X1: $o] :
( ( ( says @ peter @ X1 )
=> ~ X1 )
= $true ),
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
! [X1: $o] :
( ( ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 )
@ X1 )
= $true ),
inference(pi_clausification,[],[f14]) ).
thf(f14,plain,
( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f13]) ).
thf(f13,plain,
( ( $true != $true )
| ( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
= $true ) ),
inference(superposition,[],[f12,f11]) ).
thf(f12,plain,
! [X0: $o] :
( ( ( says @ peter @ X0 )
!= $true )
| ( $true = X0 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: $o] :
( ( ( says @ peter @ X0 )
!= $true )
| ( $true = X0 ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: $o] :
( ( ( says @ peter @ X0 )
= $true )
=> ( $true = X0 ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
~ ~ ! [X0: $o] :
( ( ( says @ peter @ X0 )
= $true )
=> ( $true = X0 ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ~ ! [X0: $o] :
( ( says @ peter @ X0 )
=> X0 ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ~ ! [X0: $o] :
( ( says @ peter @ X0 )
=> X0 ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
~ ! [X0: $o] :
( ( says @ peter @ X0 )
=> X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ083^1 : TPTP v8.2.0. Released v3.6.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 : n015.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 : Sat May 18 10:59:53 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 % (6863)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (6861)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.37 % (6864)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 % (6865)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 % (6866)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 % (6865)Refutation not found, incomplete strategy
% 0.14/0.37 % (6865)------------------------------
% 0.14/0.37 % (6865)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6865)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (6865)Memory used [KB]: 5373
% 0.14/0.37 % (6865)Time elapsed: 0.003 s
% 0.14/0.37 % (6865)Instructions burned: 1 (million)
% 0.14/0.37 % (6865)------------------------------
% 0.14/0.37 % (6865)------------------------------
% 0.14/0.38 % (6863)Instruction limit reached!
% 0.14/0.38 % (6863)------------------------------
% 0.14/0.38 % (6863)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6864)Instruction limit reached!
% 0.14/0.38 % (6864)------------------------------
% 0.14/0.38 % (6864)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6863)Termination reason: Unknown
% 0.14/0.38 % (6863)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (6863)Memory used [KB]: 5500
% 0.14/0.38 % (6863)Time elapsed: 0.004 s
% 0.14/0.38 % (6863)Instructions burned: 2 (million)
% 0.14/0.38 % (6863)------------------------------
% 0.14/0.38 % (6863)------------------------------
% 0.14/0.38 % (6864)Termination reason: Unknown
% 0.14/0.38 % (6864)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (6864)Memory used [KB]: 5500
% 0.14/0.38 % (6864)Time elapsed: 0.004 s
% 0.14/0.38 % (6864)Instructions burned: 3 (million)
% 0.14/0.38 % (6864)------------------------------
% 0.14/0.38 % (6864)------------------------------
% 0.14/0.38 % (6862)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 % (6867)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.38 % (6866)First to succeed.
% 0.14/0.38 % (6861)Instruction limit reached!
% 0.14/0.38 % (6861)------------------------------
% 0.14/0.38 % (6861)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6861)Termination reason: Unknown
% 0.14/0.38 % (6861)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (6861)Memory used [KB]: 5500
% 0.14/0.38 % (6861)Time elapsed: 0.006 s
% 0.14/0.38 % (6861)Instructions burned: 5 (million)
% 0.14/0.38 % (6861)------------------------------
% 0.14/0.38 % (6861)------------------------------
% 0.14/0.38 % (6866)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 % (6866)------------------------------
% 0.14/0.38 % (6866)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6866)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (6866)Memory used [KB]: 5500
% 0.14/0.38 % (6866)Time elapsed: 0.005 s
% 0.14/0.38 % (6866)Instructions burned: 2 (million)
% 0.14/0.38 % (6866)------------------------------
% 0.14/0.38 % (6866)------------------------------
% 0.14/0.38 % (6859)Success in time 0.006 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------