TSTP Solution File: COM035_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : COM035_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 : n025.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 10:47:33 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 55
% Syntax : Number of formulae : 65 ( 14 unt; 51 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 25 ( 16 >; 9 *; 0 +; 0 <<)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 11 con; 0-4 aty)
% Number of variables : 39 ( 9 !; 0 ?; 39 :)
% ( 30 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
atom: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
div_mod:
!>[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,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_6,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_8,type,
dvd: ( int * int * list(int) ) > atom ).
tff(func_def_9,type,
atom_size: atom > nat ).
tff(func_def_10,type,
divisor: atom > int ).
tff(func_def_11,type,
hd_coeff: atom > int ).
tff(func_def_12,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_13,type,
fFalse: bool ).
tff(func_def_14,type,
fTrue: bool ).
tff(func_def_15,type,
a: atom ).
tff(func_def_16,type,
d: int ).
tff(func_def_17,type,
e: list(int) ).
tff(func_def_18,type,
i: int ).
tff(func_def_19,type,
j: int ).
tff(func_def_20,type,
ks1: list(int) ).
tff(func_def_21,type,
ks: list(int) ).
tff(func_def_22,type,
l: int ).
tff(func_def_23,type,
sK0: list(int) ).
tff(func_def_24,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cl_Groups_Oplus:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
uminus:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ring_div:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ab_group_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
semiring_div:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
boolean_algebra:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
nat_is_nat: int > $o ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(f574,plain,
$false,
inference(subsumption_resolution,[],[f573,f340]) ).
tff(f340,plain,
div_mod(int,i,d) != div_mod(int,j,d),
inference(cnf_transformation,[],[f137]) ).
tff(f137,plain,
div_mod(int,i,d) != div_mod(int,j,d),
inference(flattening,[],[f136]) ).
tff(f136,negated_conjecture,
( ~ div_mod(int,i,d) = div_mod(int,j,d) ),
inference(negated_conjecture,[],[f135]) ).
tff(f135,conjecture,
div_mod(int,i,d) = div_mod(int,j,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f573,plain,
div_mod(int,i,d) = div_mod(int,j,d),
inference(forward_demodulation,[],[f378,f527]) ).
tff(f527,plain,
d = divisor(a),
inference(superposition,[],[f485,f376]) ).
tff(f376,plain,
a = dvd(d,l,ks),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
a = dvd(d,l,ks),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_Dvd) ).
tff(f485,plain,
! [X2: int,X0: list(int),X1: int] : ( divisor(dvd(X2,X1,X0)) = X2 ),
inference(cnf_transformation,[],[f221]) ).
tff(f221,plain,
! [X0: list(int),X1: int,X2: int] : ( divisor(dvd(X2,X1,X0)) = X2 ),
inference(rectify,[],[f64]) ).
tff(f64,axiom,
! [X26: list(int),X27: int,X28: int] : ( divisor(dvd(X28,X27,X26)) = X28 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_63_divisor_Osimps_I2_J) ).
tff(f378,plain,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_assms_I3_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : COM035_5 : TPTP v8.1.2. Released v6.0.0.
% 0.08/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 05:21:26 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (3116)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (3119)WARNING: value z3 for option sas not known
% 0.15/0.38 % (3119)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.15/0.38 % (3118)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (3117)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (3120)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (3121)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.15/0.38 % (3122)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.15/0.38 % (3123)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.15/0.39 % (3123)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.39 % Exception at run slice level
% 0.15/0.39 User error: % Exception at run slice levelFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.39 % Exception at run slice level
% 0.15/0.39 User error:
% 0.15/0.39 Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.39 % (3119)First to succeed.
% 0.15/0.39 % (3122)Also succeeded, but the first one will report.
% 0.15/0.39 % (3119)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (3119)------------------------------
% 0.15/0.39 % (3119)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (3119)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (3119)Memory used [KB]: 1064
% 0.15/0.39 % (3119)Time elapsed: 0.012 s
% 0.15/0.39 % (3119)Instructions burned: 16 (million)
% 0.15/0.39 % (3119)------------------------------
% 0.15/0.39 % (3119)------------------------------
% 0.15/0.39 % (3116)Success in time 0.03 s
%------------------------------------------------------------------------------