TSTP Solution File: SYO290^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO290^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 : n027.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:03:49 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 31 ( 8 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 59 ( 11 ~; 5 |; 1 &; 42 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 14 ^ 0 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
g2: a > a ).
thf(func_def_2,type,
g1: a > a ).
thf(func_def_3,type,
p: ( a > a ) > $o ).
thf(f10,plain,
$false,
inference(subsumption_resolution,[],[f9,f8]) ).
thf(f8,plain,
( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
= $true )
& ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
!= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
= $true )
| ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
!= $true ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ( ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
= $true )
| ( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
!= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( p
@ ^ [X0: a] : ( g1 @ ( g2 @ X0 ) ) )
| ~ ( p
@ ^ [X1: a] : ( g1 @ ( g2 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( p
@ ^ [X1: a] : ( g1 @ ( g2 @ X1 ) ) )
| ~ ( p
@ ^ [X0: a] : ( g1 @ ( g2 @ X0 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( p
@ ^ [X1: a] : ( g1 @ ( g2 @ X1 ) ) )
| ~ ( p
@ ^ [X0: a] : ( g1 @ ( g2 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRANS_BUG_EX2) ).
thf(f9,plain,
( ( p
@ ^ [Y0: a] : ( g1 @ ( g2 @ Y0 ) ) )
= $true ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO290^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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.34 % Computer : n027.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 09:21:37 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (11223)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 % (11222)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 % (11216)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 % (11218)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 % (11219)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (11220)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 % (11217)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 % (11222)First to succeed.
% 0.14/0.37 % (11221)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 % (11223)Also succeeded, but the first one will report.
% 0.14/0.37 % (11222)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 % (11222)------------------------------
% 0.14/0.37 % (11222)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (11222)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (11222)Memory used [KB]: 5373
% 0.14/0.37 % (11222)Time elapsed: 0.003 s
% 0.14/0.37 % (11222)Instructions burned: 1 (million)
% 0.14/0.37 % (11222)------------------------------
% 0.14/0.37 % (11222)------------------------------
% 0.14/0.37 % (11215)Success in time 0.004 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------