TSTP Solution File: SYO549^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO549^1 : TPTP v8.2.0. Released v5.2.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 : n009.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:06:11 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 10 unt; 3 typ; 0 def)
% Number of atoms : 61 ( 9 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 67 ( 27 ~; 0 |; 0 &; 40 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 12 ^ 0 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
p: ( $o > $o ) > ( $o > $o ) > $o ).
thf(func_def_1,type,
f: $o > $o ).
thf(func_def_2,type,
g: $o > $o ).
thf(f16,plain,
$false,
inference(subsumption_resolution,[],[f13,f15]) ).
thf(f15,plain,
( ( p @ f @ g )
= $true ),
inference(beta_eta_normalization,[],[f14]) ).
thf(f14,plain,
( $true
= ( p
@ ^ [Y0: $o] : ( f @ Y0 )
@ g ) ),
inference(boolean_simplification,[],[f11]) ).
thf(f11,plain,
( ( p
@ ^ [Y0: $o] :
( f
@ ~ ~ Y0 )
@ g )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( p
@ ^ [Y0: $o] :
( f
@ ~ ~ Y0 )
@ g )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
( p
@ ^ [X0: $o] :
( f
@ ~ ~ X0 )
@ g ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( p
@ ^ [X0: $o] :
( f
@ ~ ~ X0 )
@ g ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfg) ).
thf(f13,plain,
( ( p @ f @ g )
!= $true ),
inference(beta_eta_normalization,[],[f12]) ).
thf(f12,plain,
( ( p @ f
@ ^ [Y0: $o] : ( g @ Y0 ) )
!= $true ),
inference(boolean_simplification,[],[f10]) ).
thf(f10,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfgc) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO549^1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.13 % 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.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 08:36:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 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.21/0.37 % (9992)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.21/0.38 % (9992)First to succeed.
% 0.21/0.38 % (9986)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.21/0.38 % (9988)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.38 % (9987)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.21/0.38 % (9990)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.21/0.38 % (9989)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.21/0.38 % (9991)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (9992)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (9992)------------------------------
% 0.21/0.38 % (9992)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (9992)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (9992)Memory used [KB]: 5373
% 0.21/0.38 % (9992)Time elapsed: 0.004 s
% 0.21/0.38 % (9992)Instructions burned: 1 (million)
% 0.21/0.38 % (9992)------------------------------
% 0.21/0.38 % (9992)------------------------------
% 0.21/0.38 % (9984)Success in time 0.014 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------