TSTP Solution File: NUN008_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUN008_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n027.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 Apr 30 14:40:10 EDT 2024
% Result : Theorem 0.18s 0.37s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 34
% Syntax : Number of formulae : 40 ( 8 unt; 32 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 15 ( 10 >; 5 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-3 aty)
% Number of variables : 16 ( 0 !; 0 ?; 16 :)
% ( 16 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(func_def_0,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
bit0: int > int ).
tff(func_def_5,type,
bit1: int > int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_9,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
m1: int ).
tff(func_def_13,type,
n: nat ).
tff(func_def_14,type,
r: int ).
tff(func_def_15,type,
sa: int ).
tff(func_def_16,type,
v: int ).
tff(func_def_17,type,
w: int ).
tff(func_def_18,type,
sK0: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
dvd_dvd:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_10,type,
pp: bool > $o ).
tff(f393,plain,
$false,
inference(trivial_inequality_removal,[],[f392]) ).
tff(f392,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(backward_demodulation,[],[f260,f283]) ).
tff(f283,plain,
plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_m1) ).
tff(f260,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(cnf_transformation,[],[f116]) ).
tff(f116,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(flattening,[],[f115]) ).
tff(f115,negated_conjecture,
( ~ plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) ),
inference(negated_conjecture,[],[f114]) ).
tff(f114,conjecture,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN008_5 : TPTP v8.1.2. Released v6.0.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 02:56:32 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (19957)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.37 % (19960)WARNING: value z3 for option sas not known
% 0.18/0.37 % (19962)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.18/0.37 % (19960)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.18/0.37 % (19959)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.18/0.37 % (19964)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.18/0.37 % (19961)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.18/0.37 % (19963)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.18/0.37 % (19958)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.18/0.37 % (19964)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.18/0.37 % Exception at run slice level
% 0.18/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.37 % (19963)First to succeed.
% 0.18/0.37 % Exception at run slice level
% 0.18/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.37 % (19963)Refutation found. Thanks to Tanya!
% 0.18/0.37 % SZS status Theorem for theBenchmark
% 0.18/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.37 % (19963)------------------------------
% 0.18/0.37 % (19963)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.18/0.37 % (19963)Termination reason: Refutation
% 0.18/0.37
% 0.18/0.37 % (19963)Memory used [KB]: 897
% 0.18/0.37 % (19963)Time elapsed: 0.006 s
% 0.18/0.37 % (19963)Instructions burned: 10 (million)
% 0.18/0.37 % (19963)------------------------------
% 0.18/0.37 % (19963)------------------------------
% 0.18/0.37 % (19957)Success in time 0.027 s
%------------------------------------------------------------------------------