TSTP Solution File: SYO217^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO217^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 : 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:32 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 49 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 146 ( 44 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 167 ( 31 ~; 29 |; 5 &; 90 @)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 32 !; 6 ?; 39 :)
% ( 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_5,type,
sK0: b > a > $o ).
thf(func_def_6,type,
sK1: b > a > $o ).
thf(func_def_8,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
sK4: b ).
thf(func_def_10,type,
sK5: a ).
thf(f70,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f35,f41,f50,f69]) ).
thf(f69,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| spl2_3
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f62,f29]) ).
thf(f29,plain,
( ( $false
!= ( sK0 @ sK4 @ sK5 ) )
| spl2_3 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f28,plain,
( spl2_3
<=> ( $false
= ( sK0 @ sK4 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f62,plain,
( ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
( ( $true = $false )
| ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl2_4 ),
inference(superposition,[],[f13,f34]) ).
thf(f34,plain,
( ( ( sK1 @ sK4 @ sK5 )
= $false )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f32,plain,
( spl2_4
<=> ( ( sK1 @ sK4 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f13,plain,
! [X2: b,X3: a] :
( ( $true
= ( sK1 @ X2 @ X3 ) )
| ( ( sK0 @ X2 @ X3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
! [X2: b,X3: a] :
( ( sK0 @ X2 @ X3 )
= ( sK1 @ X2 @ X3 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ! [X2: b,X3: a] :
( ( sK0 @ X2 @ X3 )
= ( sK1 @ X2 @ X3 ) )
& ( sK0 != sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X0 @ X2 @ X3 )
= ( X1 @ X2 @ X3 ) )
& ( X0 != X1 ) )
=> ( ! [X3: a,X2: b] :
( ( sK0 @ X2 @ X3 )
= ( sK1 @ X2 @ X3 ) )
& ( sK0 != sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X0 @ X2 @ X3 )
= ( X1 @ X2 @ X3 ) )
& ( X0 != X1 ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X1: b > a > $o,X0: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X0 @ X2 @ X3 )
= ( X1 @ X2 @ X3 ) )
& ( X0 != X1 ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X0 @ X2 @ X3 )
= ( X1 @ X2 @ X3 ) )
=> ( X0 = X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X1 @ X2 @ X3 )
<=> ( X0 @ X2 @ X3 ) )
=> ( X0 = X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X1 @ X2 @ X3 )
<=> ( X0 @ X2 @ X3 ) )
=> ( X0 = X1 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: b > a > $o,X1: b > a > $o] :
( ! [X2: b,X3: a] :
( ( X1 @ X2 @ X3 )
<=> ( X0 @ X2 @ X3 ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM174) ).
thf(f50,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f49]) ).
thf(f49,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(subsumption_resolution,[],[f45,f24]) ).
thf(f24,plain,
( ( $true
!= ( sK0 @ sK4 @ sK5 ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl2_2
<=> ( $true
= ( sK0 @ sK4 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f45,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ( $true = $false )
| ~ spl2_1 ),
inference(superposition,[],[f21,f12]) ).
thf(f12,plain,
! [X2: b,X3: a] :
( ( ( sK1 @ X2 @ X3 )
= $false )
| ( ( sK0 @ X2 @ X3 )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f21,plain,
( ( ( sK1 @ sK4 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl2_1
<=> ( ( sK1 @ sK4 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f41,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f40,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_3 ),
inference(superposition,[],[f30,f25]) ).
thf(f25,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f30,plain,
( ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f35,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f17,f32,f28]) ).
thf(f17,plain,
( ( $false
= ( sK0 @ sK4 @ sK5 ) )
| ( ( sK1 @ sK4 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( sK1 @ sK4 @ sK5 )
!= ( sK0 @ sK4 @ sK5 ) ),
inference(negative_extensionality,[],[f14]) ).
thf(f14,plain,
( ( sK1 @ sK4 )
!= ( sK0 @ sK4 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f10,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f9]) ).
thf(f26,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f16,f23,f19]) ).
thf(f16,plain,
( ( $true
= ( sK0 @ sK4 @ sK5 ) )
| ( ( sK1 @ sK4 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO217^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:16:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.37 % (16352)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.13/0.37 % (16355)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (16356)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.13/0.37 % (16358)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (16356)Instruction limit reached!
% 0.13/0.37 % (16356)------------------------------
% 0.13/0.37 % (16356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16356)Termination reason: Unknown
% 0.13/0.37 % (16356)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16356)Memory used [KB]: 895
% 0.13/0.37 % (16356)Time elapsed: 0.002 s
% 0.13/0.37 % (16356)Instructions burned: 2 (million)
% 0.13/0.37 % (16356)------------------------------
% 0.13/0.37 % (16356)------------------------------
% 0.13/0.37 % (16357)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.13/0.37 % (16355)Instruction limit reached!
% 0.13/0.37 % (16355)------------------------------
% 0.13/0.37 % (16355)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16355)Termination reason: Unknown
% 0.13/0.37 % (16355)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16355)Memory used [KB]: 5500
% 0.13/0.37 % (16355)Time elapsed: 0.004 s
% 0.13/0.37 % (16355)Instructions burned: 3 (million)
% 0.13/0.37 % (16355)------------------------------
% 0.13/0.37 % (16355)------------------------------
% 0.13/0.37 % (16352)First to succeed.
% 0.13/0.37 % (16358)Also succeeded, but the first one will report.
% 0.13/0.37 % (16357)Also succeeded, but the first one will report.
% 0.13/0.37 % (16352)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (16352)------------------------------
% 0.13/0.37 % (16352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16352)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (16352)Memory used [KB]: 5500
% 0.13/0.37 % (16352)Time elapsed: 0.005 s
% 0.13/0.37 % (16352)Instructions burned: 3 (million)
% 0.13/0.37 % (16352)------------------------------
% 0.13/0.37 % (16352)------------------------------
% 0.13/0.37 % (16351)Success in time 0.003 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------