TSTP Solution File: SEV013^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEV013^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 04:14:12 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 34 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 87 ( 72 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 95 ( 34 ~; 22 |; 30 &)
% ( 0 <=>; 9 =>; 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 : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 48 ( 18 !; 30 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(func_def_0,type,
a: $tType ).
tff(func_def_1,type,
sK1: a ).
tff(func_def_2,type,
sK2: a ).
tff(func_def_3,type,
sK3: a ).
tff(func_def_4,type,
sK4: a ).
tff(func_def_5,type,
sK5: a ).
tff(func_def_6,type,
sK6: a ).
tff(f31,plain,
$false,
inference(unit_resulting_resolution,[],[f22,f27,f17]) ).
tff(f17,plain,
( ~ sP0
| ( sK1 != sK3 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
( ( ( sK1 != sK3 )
& ( sK2 = sK3 )
& ( sK1 = sK2 ) )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f8,f9]) ).
tff(f9,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
=> ( ( sK1 != sK3 )
& ( sK2 = sK3 )
& ( sK1 = sK2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f27,plain,
sK1 = sK3,
inference(forward_demodulation,[],[f25,f23]) ).
tff(f23,plain,
sK1 = sK2,
inference(unit_resulting_resolution,[],[f22,f15]) ).
tff(f15,plain,
( ~ sP0
| ( sK1 = sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f25,plain,
sK2 = sK3,
inference(unit_resulting_resolution,[],[f22,f16]) ).
tff(f16,plain,
( ~ sP0
| ( sK2 = sK3 ) ),
inference(cnf_transformation,[],[f10]) ).
tff(f22,plain,
sP0,
inference(subsumption_resolution,[],[f20,f21]) ).
tff(f21,plain,
( ( sK4 != sK5 )
| sP0 ),
inference(trivial_inequality_removal,[],[f19]) ).
tff(f19,plain,
( sP0
| ( sK4 != sK5 )
| ( sK6 != sK6 ) ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
( sP0
| ( ( sK4 != sK5 )
& ( sK4 = sK5 ) )
| ( sK6 != sK6 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f11,f13,f12]) ).
tff(f12,plain,
( ? [X0: a,X1: a] :
( ( X0 != X1 )
& ( X0 = X1 ) )
=> ( ( sK4 != sK5 )
& ( sK4 = sK5 ) ) ),
introduced(choice_axiom,[]) ).
tff(f13,plain,
( ? [X2: a] : ( X2 != X2 )
=> ( sK6 != sK6 ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( sP0
| ? [X0: a,X1: a] :
( ( X0 != X1 )
& ( X0 = X1 ) )
| ? [X2: a] : ( X2 != X2 ) ),
inference(rectify,[],[f7]) ).
tff(f7,plain,
( sP0
| ? [X3: a,X4: a] :
( ( X3 != X4 )
& ( X3 = X4 ) )
| ? [X5: a] : ( X5 != X5 ) ),
inference(definition_folding,[],[f5,f6]) ).
tff(f5,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ? [X3: a,X4: a] :
( ( X3 != X4 )
& ( X3 = X4 ) )
| ? [X5: a] : ( X5 != X5 ) ),
inference(flattening,[],[f4]) ).
tff(f4,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ? [X3: a,X4: a] :
( ( X3 != X4 )
& ( X3 = X4 ) )
| ? [X5: a] : ( X5 != X5 ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X3: a,X4: a] :
( ( X3 = X4 )
=> ( X3 = X4 ) )
& ! [X5: a] : ( X5 = X5 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X0: a,X1: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) )
& ! [X0: a] : ( X0 = X0 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X0: a,X1: a] :
( ( X0 = X1 )
=> ( X0 = X1 ) )
& ! [X0: a] : ( X0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM511_pme) ).
tff(f20,plain,
( sP0
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[],[f18]) ).
tff(f18,plain,
( sP0
| ( sK4 = sK5 )
| ( sK6 != sK6 ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV013^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 19:10:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (3108)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.32 % (3115)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.10/0.32 % (3114)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.10/0.32 % (3111)WARNING: value z3 for option sas not known
% 0.10/0.33 % (3113)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.10/0.33 % (3115)First to succeed.
% 0.10/0.33 % (3114)Also succeeded, but the first one will report.
% 0.10/0.33 % (3111)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.33 % (3115)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3108"
% 0.10/0.33 % (3112)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.10/0.33 % (3115)Refutation found. Thanks to Tanya!
% 0.10/0.33 % SZS status Theorem for theBenchmark
% 0.10/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.33 % (3115)------------------------------
% 0.10/0.33 % (3115)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.10/0.33 % (3115)Termination reason: Refutation
% 0.10/0.33
% 0.10/0.33 % (3115)Memory used [KB]: 750
% 0.10/0.33 % (3115)Time elapsed: 0.004 s
% 0.10/0.33 % (3115)Instructions burned: 3 (million)
% 0.10/0.33 % (3108)Success in time 0.014 s
%------------------------------------------------------------------------------