TSTP Solution File: SEV013^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV013^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 : n012.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 04:11:41 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 47 ( 1 unt; 8 typ; 0 def)
% Number of atoms : 121 ( 92 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 132 ( 50 ~; 42 |; 27 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 42 ( 18 !; 24 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(func_def_0,type,
a: $tType ).
tff(func_def_1,type,
sK0: a ).
tff(func_def_2,type,
sK1: a ).
tff(func_def_3,type,
sK2: a ).
tff(func_def_4,type,
sK3: a ).
tff(func_def_5,type,
sK4: a ).
tff(func_def_6,type,
sK5: a ).
tff(f45,plain,
$false,
inference(avatar_sat_refutation,[],[f29,f33,f35,f39,f40,f41,f44]) ).
tff(f44,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f43]) ).
tff(f43,plain,
( $false
| spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f25,f42]) ).
tff(f42,plain,
( ( sK3 = sK4 )
| ~ spl6_3
| ~ spl6_4 ),
inference(backward_demodulation,[],[f38,f32]) ).
tff(f32,plain,
( ( sK3 = sK5 )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f31]) ).
tff(f31,plain,
( spl6_3
<=> ( sK3 = sK5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
tff(f38,plain,
( ( sK4 = sK5 )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f37,plain,
( spl6_4
<=> ( sK4 = sK5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
tff(f25,plain,
( ( sK3 != sK4 )
| spl6_1 ),
inference(avatar_component_clause,[],[f24]) ).
tff(f24,plain,
( spl6_1
<=> ( sK3 = sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
tff(f41,plain,
( spl6_4
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f17,f27,f37]) ).
tff(f27,plain,
( spl6_2
<=> ( sK0 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
tff(f17,plain,
( ( sK4 = sK5 )
| ( sK0 != sK1 ) ),
inference(trivial_inequality_removal,[],[f12]) ).
tff(f12,plain,
( ( sK0 != sK1 )
| ( sK4 = sK5 )
| ( sK2 != sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
( ( ( sK0 = sK1 )
& ( sK0 != sK1 ) )
| ( sK2 != sK2 )
| ( ( sK3 = sK5 )
& ( sK4 = sK5 )
& ( sK3 != sK4 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f9,f8,f7]) ).
tff(f7,plain,
( ? [X0: a,X1: a] :
( ( X0 = X1 )
& ( X0 != X1 ) )
=> ( ( sK0 = sK1 )
& ( sK0 != sK1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
( ? [X2: a] : ( X2 != X2 )
=> ( sK2 != sK2 ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ? [X3: a,X4: a,X5: a] :
( ( X3 = X5 )
& ( X4 = X5 )
& ( X3 != X4 ) )
=> ( ( sK3 = sK5 )
& ( sK4 = sK5 )
& ( sK3 != sK4 ) ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
( ? [X0: a,X1: a] :
( ( X0 = X1 )
& ( X0 != X1 ) )
| ? [X2: a] : ( X2 != X2 )
| ? [X3: a,X4: a,X5: a] :
( ( X3 = X5 )
& ( X4 = X5 )
& ( X3 != X4 ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
( ? [X0: a,X1: a] :
( ( X0 = X1 )
& ( X0 != X1 ) )
| ? [X5: a] : ( X5 != X5 )
| ? [X4: a,X3: a,X2: a] :
( ( X2 = X4 )
& ( X2 = X3 )
& ( X3 != X4 ) ) ),
inference(flattening,[],[f4]) ).
tff(f4,plain,
( ? [X0: a,X1: a] :
( ( X0 = X1 )
& ( X0 != X1 ) )
| ? [X5: a] : ( X5 != X5 )
| ? [X3: a,X4: a,X2: a] :
( ( X3 != X4 )
& ( X2 = X4 )
& ( X2 = X3 ) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X1: a,X0: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) )
& ! [X5: a] : ( X5 = X5 )
& ! [X3: a,X4: a,X2: a] :
( ( ( X2 = X4 )
& ( X2 = X3 ) )
=> ( X3 = X4 ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X1: a,X0: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( X0 = X2 ) )
& ! [X0: a] : ( X0 = X0 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X1: a,X0: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( X0 = X1 )
& ( X1 = X2 ) )
=> ( X0 = X2 ) )
& ! [X0: a] : ( X0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM511_pme) ).
tff(f40,plain,
( ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f18,f24,f27]) ).
tff(f18,plain,
( ( sK3 != sK4 )
| ( sK0 != sK1 ) ),
inference(trivial_inequality_removal,[],[f11]) ).
tff(f11,plain,
( ( sK0 != sK1 )
| ( sK3 != sK4 )
| ( sK2 != sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f39,plain,
( spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f19,f27,f37]) ).
tff(f19,plain,
( ( sK0 = sK1 )
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[],[f15]) ).
tff(f15,plain,
( ( sK4 = sK5 )
| ( sK2 != sK2 )
| ( sK0 = sK1 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f35,plain,
( ~ spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f20,f31,f27]) ).
tff(f20,plain,
( ( sK0 != sK1 )
| ( sK3 = sK5 ) ),
inference(trivial_inequality_removal,[],[f13]) ).
tff(f13,plain,
( ( sK0 != sK1 )
| ( sK2 != sK2 )
| ( sK3 = sK5 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f33,plain,
( spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f21,f31,f27]) ).
tff(f21,plain,
( ( sK0 = sK1 )
| ( sK3 = sK5 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
tff(f16,plain,
( ( sK0 = sK1 )
| ( sK3 = sK5 )
| ( sK2 != sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f29,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f22,f27,f24]) ).
tff(f22,plain,
( ( sK3 != sK4 )
| ( sK0 = sK1 ) ),
inference(trivial_inequality_removal,[],[f14]) ).
tff(f14,plain,
( ( sK0 = sK1 )
| ( sK3 != sK4 )
| ( sK2 != sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV013^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.13/0.34 % Computer : n012.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.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 19:10:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 % (31272)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.13/0.36 % (31272)First to succeed.
% 0.13/0.36 % (31272)Refutation found. Thanks to Tanya!
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 % (31272)------------------------------
% 0.13/0.36 % (31272)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (31272)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (31272)Memory used [KB]: 5500
% 0.13/0.36 % (31272)Time elapsed: 0.002 s
% 0.13/0.36 % (31272)Instructions burned: 1 (million)
% 0.13/0.36 % (31272)------------------------------
% 0.13/0.36 % (31272)------------------------------
% 0.13/0.36 % (31259)Success in time 0.004 s
% 0.13/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------