TSTP Solution File: SYO256^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO256^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 : n013.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:40 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 40 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 131 ( 22 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 183 ( 36 ~; 43 |; 0 &; 84 @)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 9 usr; 7 con; 0-2 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 50 ( 12 ^ 26 !; 10 ?; 50 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_9,type,
sK0: $o > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > $o ).
thf(func_def_13,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f45,plain,
$false,
inference(avatar_sat_refutation,[],[f19,f27,f30,f33,f37,f44]) ).
thf(f44,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f43]) ).
thf(f43,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(superposition,[],[f14,f26]) ).
thf(f26,plain,
( ( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl3_4
<=> ( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f14,plain,
( ! [X3: $o] :
( $true
= ( sK0 @ X3 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f13,plain,
( spl3_1
<=> ! [X3: $o] :
( $true
= ( sK0 @ X3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f37,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f36]) ).
thf(f36,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_4 ),
inference(backward_demodulation,[],[f18,f26]) ).
thf(f18,plain,
( ( $true
= ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f16]) ).
thf(f16,plain,
( spl3_2
<=> ( $true
= ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f33,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f32]) ).
thf(f32,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f14,f22]) ).
thf(f22,plain,
( ! [X3: $o] :
( ( sK0 @ X3 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f21,plain,
( spl3_3
<=> ! [X3: $o] :
( ( sK0 @ X3 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f30,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f29]) ).
thf(f29,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f28,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_3 ),
inference(forward_demodulation,[],[f18,f22]) ).
thf(f27,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f11,f24,f21]) ).
thf(f11,plain,
! [X3: $o] :
( ( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
= $false )
| ( ( sK0 @ X3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f9,plain,
! [X3: $o] :
( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
!= ( sK0 @ X3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
! [X3: $o] :
( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
!= ( sK0 @ X3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: $o > $o,X1: a > $o,X2: a > $o] :
! [X3: $o] :
( ( X0 @ X3 )
!= ( X0
@ ( !! @ a
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X1 @ Y0 ) ) ) ) )
=> ! [X3: $o] :
( ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) )
!= ( sK0 @ X3 ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: $o > $o,X1: a > $o,X2: a > $o] :
! [X3: $o] :
( ( X0 @ X3 )
!= ( X0
@ ( !! @ a
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X1 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: $o > $o,X1: a > $o,X2: a > $o] :
? [X3: $o] :
( ( X0 @ X3 )
= ( X0
@ ( !! @ a
@ ^ [Y0: a] :
( ( X2 @ Y0 )
| ( X1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: $o > $o,X1: a > $o,X2: a > $o] :
? [X3: $o] :
( ( X0 @ X3 )
<=> ( X0
@ ! [X4: a] :
( ( X1 @ X4 )
| ( X2 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: $o > $o,X1: a > $o,X2: a > $o] :
? [X3: $o] :
( ( X0 @ X3 )
<=> ( X0
@ ! [X4: a] :
( ( X1 @ X4 )
| ( X2 @ X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: $o > $o,X1: a > $o,X2: a > $o] :
? [X3: $o] :
( ( X0 @ X3 )
<=> ( X0
@ ! [X4: a] :
( ( X1 @ X4 )
| ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM121) ).
thf(f19,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f10,f16,f13]) ).
thf(f10,plain,
! [X3: $o] :
( ( $true
= ( sK0 @ X3 ) )
| ( $true
= ( sK0
@ ( !! @ a
@ ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO256^5 : TPTP v8.2.0. Released v4.0.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.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 10:23:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 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.15/0.37 % (26617)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.15/0.37 % (26617)First to succeed.
% 0.15/0.37 % (26617)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (26617)------------------------------
% 0.15/0.37 % (26617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (26617)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (26617)Memory used [KB]: 5500
% 0.15/0.37 % (26617)Time elapsed: 0.004 s
% 0.15/0.37 % (26617)Instructions burned: 2 (million)
% 0.15/0.37 % (26617)------------------------------
% 0.15/0.37 % (26617)------------------------------
% 0.15/0.37 % (26614)Success in time 0.007 s
% 0.15/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------