TSTP Solution File: SEU886^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU886^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 : n022.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 03:52:04 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 34 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 170 ( 71 equ; 0 cnn)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 207 ( 45 ~; 29 |; 36 &; 89 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 ^ 20 !; 18 ?; 38 :)
% 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,
f: b > a ).
thf(func_def_3,type,
y: b > $o ).
thf(func_def_4,type,
x: b > $o ).
thf(func_def_8,type,
sK0: a ).
thf(func_def_9,type,
sK1: b ).
thf(f28,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f24,f27]) ).
thf(f27,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f26]) ).
thf(f26,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f25,f12]) ).
thf(f12,plain,
( ( y @ sK1 )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( sK0
= ( f @ sK1 ) )
& ( ( y @ sK1 )
= $true )
& ( ( x @ sK1 )
= $true )
& ( ! [X2: b] :
( ( sK0
!= ( f @ X2 ) )
| ( ( y @ X2 )
!= $true ) )
| ! [X3: b] :
( ( sK0
!= ( f @ X3 ) )
| ( ( x @ X3 )
!= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
thf(f7,plain,
( ? [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( ( y @ X1 )
= $true )
& ( ( x @ X1 )
= $true ) )
& ( ! [X2: b] :
( ( ( f @ X2 )
!= X0 )
| ( ( y @ X2 )
!= $true ) )
| ! [X3: b] :
( ( ( f @ X3 )
!= X0 )
| ( ( x @ X3 )
!= $true ) ) ) )
=> ( ? [X1: b] :
( ( ( f @ X1 )
= sK0 )
& ( ( y @ X1 )
= $true )
& ( ( x @ X1 )
= $true ) )
& ( ! [X2: b] :
( ( sK0
!= ( f @ X2 ) )
| ( ( y @ X2 )
!= $true ) )
| ! [X3: b] :
( ( sK0
!= ( f @ X3 ) )
| ( ( x @ X3 )
!= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X1: b] :
( ( ( f @ X1 )
= sK0 )
& ( ( y @ X1 )
= $true )
& ( ( x @ X1 )
= $true ) )
=> ( ( sK0
= ( f @ sK1 ) )
& ( ( y @ sK1 )
= $true )
& ( ( x @ sK1 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( ( y @ X1 )
= $true )
& ( ( x @ X1 )
= $true ) )
& ( ! [X2: b] :
( ( ( f @ X2 )
!= X0 )
| ( ( y @ X2 )
!= $true ) )
| ! [X3: b] :
( ( ( f @ X3 )
!= X0 )
| ( ( x @ X3 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( ( y @ X1 )
= $true )
& ( ( x @ X1 )
= $true ) )
=> ( ? [X3: b] :
( ( ( x @ X3 )
= $true )
& ( ( f @ X3 )
= X0 ) )
& ? [X2: b] :
( ( ( f @ X2 )
= X0 )
& ( ( y @ X2 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( y @ X1 )
& ( x @ X1 ) )
=> ( ? [X2: b] :
( ( ( f @ X2 )
= X0 )
& ( y @ X2 ) )
& ? [X3: b] :
( ( ( f @ X3 )
= X0 )
& ( x @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( y @ X1 )
& ( x @ X1 ) )
=> ( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( y @ X1 ) )
& ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( x @ X1 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( y @ X1 )
& ( x @ X1 ) )
=> ( ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( y @ X1 ) )
& ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ( x @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5203_pme) ).
thf(f25,plain,
( ( ( y @ sK1 )
!= $true )
| ~ spl2_1 ),
inference(equality_resolution,[],[f17]) ).
thf(f17,plain,
( ! [X2: b] :
( ( ( f @ X2 )
!= ( f @ sK1 ) )
| ( ( y @ X2 )
!= $true ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f16]) ).
thf(f16,plain,
( spl2_1
<=> ! [X2: b] :
( ( ( y @ X2 )
!= $true )
| ( ( f @ X2 )
!= ( f @ sK1 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f24,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f23]) ).
thf(f23,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f22,f11]) ).
thf(f11,plain,
( ( x @ sK1 )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f22,plain,
( ( ( x @ sK1 )
!= $true )
| ~ spl2_2 ),
inference(equality_resolution,[],[f20]) ).
thf(f20,plain,
( ! [X3: b] :
( ( ( f @ sK1 )
!= ( f @ X3 ) )
| ( ( x @ X3 )
!= $true ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl2_2
<=> ! [X3: b] :
( ( ( f @ sK1 )
!= ( f @ X3 ) )
| ( ( x @ X3 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f21,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f14,f19,f16]) ).
thf(f14,plain,
! [X2: b,X3: b] :
( ( ( y @ X2 )
!= $true )
| ( ( f @ sK1 )
!= ( f @ X3 ) )
| ( ( f @ X2 )
!= ( f @ sK1 ) )
| ( ( x @ X3 )
!= $true ) ),
inference(definition_unfolding,[],[f10,f13,f13]) ).
thf(f13,plain,
( sK0
= ( f @ sK1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f10,plain,
! [X2: b,X3: b] :
( ( sK0
!= ( f @ X2 ) )
| ( ( y @ X2 )
!= $true )
| ( sK0
!= ( f @ X3 ) )
| ( ( x @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU886^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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 : n022.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 : Sun May 19 15:52:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_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 % (8416)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.15/0.37 % (8416)First to succeed.
% 0.15/0.37 % (8421)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.15/0.37 % (8416)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 % (8416)------------------------------
% 0.15/0.37 % (8416)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (8416)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (8416)Memory used [KB]: 5500
% 0.15/0.37 % (8416)Time elapsed: 0.003 s
% 0.15/0.37 % (8416)Instructions burned: 2 (million)
% 0.15/0.37 % (8416)------------------------------
% 0.15/0.37 % (8416)------------------------------
% 0.15/0.37 % (8415)Success in time 0.01 s
% 0.15/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------