TSTP Solution File: SYO236^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO236^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:36 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 28 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 56 ( 30 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 87 ( 19 ~; 18 |; 2 &; 38 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 18 !; 0 ?; 19 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
g: b > a ).
thf(func_def_3,type,
f: b > a ).
thf(func_def_9,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
sK2: b ).
thf(f34,plain,
$false,
inference(avatar_sat_refutation,[],[f16,f19,f33]) ).
thf(f33,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f32]) ).
thf(f32,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f21,f8]) ).
thf(f8,plain,
f != g,
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ! [X1: ( b > a ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ) )
& ( f != g ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ( ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) )
| ! [X0: ( b > a ) > $o] :
( ( ( X0 @ f )
!= $true )
| ( ( X0 @ g )
= $true ) ) )
& ( f != g ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: ( b > a ) > $o] :
( ( ( X0 @ f )
= $true )
=> ( ( X0 @ g )
= $true ) )
| ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) ) )
=> ( f = g ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: ( b > a ) > $o] :
( ( X0 @ f )
=> ( X0 @ g ) )
| ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) ) )
=> ( f = g ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: ( b > a ) > $o] :
( ( X0 @ f )
=> ( X0 @ g ) )
| ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) ) )
=> ( f = g ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: ( b > a ) > $o] :
( ( X0 @ f )
=> ( X0 @ g ) )
| ! [X1: b] :
( ( f @ X1 )
= ( g @ X1 ) ) )
=> ( f = g ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM504) ).
thf(f21,plain,
( ( f = g )
| ~ spl0_1 ),
inference(leibniz_equality_elimination,[],[f12]) ).
thf(f12,plain,
( ! [X1: ( b > a ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f11]) ).
thf(f11,plain,
( spl0_1
<=> ! [X1: ( b > a ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f19,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f18]) ).
thf(f18,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f17,f15]) ).
thf(f15,plain,
( ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f14,plain,
( spl0_2
<=> ! [X0: b] :
( ( g @ X0 )
= ( f @ X0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f17,plain,
( ( f @ sK2 )
!= ( g @ sK2 ) ),
inference(negative_extensionality,[],[f8]) ).
thf(f16,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f9,f14,f11]) ).
thf(f9,plain,
! [X0: b,X1: ( b > a ) > $o] :
( ( ( g @ X0 )
= ( f @ X0 ) )
| ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYO236^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.16 % 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.16/0.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 08:57:37 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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.16/0.40 % (12634)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 % (12634)Refutation not found, incomplete strategy
% 0.16/0.40 % (12634)------------------------------
% 0.16/0.40 % (12634)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (12634)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (12634)Memory used [KB]: 5500
% 0.16/0.40 % (12634)Time elapsed: 0.004 s
% 0.16/0.40 % (12634)Instructions burned: 2 (million)
% 0.16/0.40 % (12634)------------------------------
% 0.16/0.40 % (12634)------------------------------
% 0.16/0.40 % (12639)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 % (12639)First to succeed.
% 0.16/0.40 % (12639)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.40 % (12639)------------------------------
% 0.16/0.40 % (12639)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (12639)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (12639)Memory used [KB]: 5500
% 0.16/0.40 % (12639)Time elapsed: 0.003 s
% 0.16/0.40 % (12639)Instructions burned: 2 (million)
% 0.16/0.40 % (12639)------------------------------
% 0.16/0.40 % (12639)------------------------------
% 0.16/0.40 % (12631)Success in time 0.021 s
% 0.16/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------