TSTP Solution File: SEV051^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV051^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n017.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 : Mon Jun 24 16:01:37 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 46 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 7 |; 18 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 28 ( 12 !; 16 ?; 28 :)
% 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(f17,plain,
$false,
inference(subsumption_resolution,[],[f13,f16]) ).
tff(f16,plain,
sK1 = sK0,
inference(forward_demodulation,[],[f14,f15]) ).
tff(f15,plain,
sK0 = sK2,
inference(trivial_inequality_removal,[],[f11]) ).
tff(f11,plain,
( ( sK0 = sK2 )
| ( sK3 != sK3 ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ( ( sK1 = sK2 )
& ( sK0 = sK2 )
& ( sK1 != sK0 ) )
| ( sK3 != sK3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f8,f7]) ).
tff(f7,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X1 = X2 )
& ( X0 = X2 )
& ( X0 != X1 ) )
=> ( ( sK1 = sK2 )
& ( sK0 = sK2 )
& ( sK1 != sK0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
( ? [X3: a] : ( X3 != X3 )
=> ( sK3 != sK3 ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X1 = X2 )
& ( X0 = X2 )
& ( X0 != X1 ) )
| ? [X3: a] : ( X3 != X3 ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
( ? [X1: a,X3: a,X2: a] :
( ( X2 = X3 )
& ( X1 = X2 )
& ( X1 != X3 ) )
| ? [X0: a] : ( X0 != X0 ) ),
inference(flattening,[],[f4]) ).
tff(f4,plain,
( ? [X1: a,X3: a,X2: a] :
( ( X1 != X3 )
& ( X2 = X3 )
& ( X1 = X2 ) )
| ? [X0: a] : ( X0 != X0 ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X1: a,X3: a,X2: a] :
( ( ( X2 = X3 )
& ( X1 = X2 ) )
=> ( X1 = X3 ) )
& ! [X0: a] : ( X0 = X0 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: a] : ( X0 = X0 )
& ! [X2: a,X3: a,X1: a] :
( ( ( X1 = X3 )
& ( X2 = X3 ) )
=> ( X1 = X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: a] : ( X0 = X0 )
& ! [X2: a,X3: a,X1: a] :
( ( ( X1 = X3 )
& ( X2 = X3 ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM557_pme) ).
tff(f14,plain,
sK1 = sK2,
inference(trivial_inequality_removal,[],[f12]) ).
tff(f12,plain,
( ( sK3 != sK3 )
| ( sK1 = sK2 ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
sK1 != sK0,
inference(trivial_inequality_removal,[],[f10]) ).
tff(f10,plain,
( ( sK3 != sK3 )
| ( sK1 != sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEV051^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : run_vampire %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Jun 21 18:32:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.37 This is a TH0_THM_EQU_NAR problem
% 0.13/0.37 Running higher-order theorem proving
% 0.13/0.37 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.13/0.39 % (28830)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (28830)First to succeed.
% 0.13/0.39 % (28830)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.39 % (28830)------------------------------
% 0.13/0.39 % (28830)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (28830)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (28830)Memory used [KB]: 5373
% 0.13/0.39 % (28830)Time elapsed: 0.002 s
% 0.13/0.39 % (28830)Instructions burned: 1 (million)
% 0.13/0.39 % (28830)------------------------------
% 0.13/0.39 % (28830)------------------------------
% 0.13/0.39 % (28826)Success in time 0.012 s
%------------------------------------------------------------------------------